TY - GEN
T1 - Minimum-Link C-Oriented Paths Visiting a Sequence of Regions in the Plane
AU - Geva, Kerem
AU - Katz, Matthew J.
AU - Mitchell, Joseph S.B.
AU - Packer, Eli
N1 - Publisher Copyright:
© 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2023/1/1
Y1 - 2023/1/1
N2 - Let be a set of C-oriented disjoint segments in R is a given finite set of orientations that spans the plane, and let s and t be two points. We seek a minimum-link C-oriented tour of E, that is, a polygonal path from s to t that visits the segments of E in order, such that, the orientations of its edges are in C and their number is minimum. We present an algorithm for computing such a tour in time. This problem already captures most of the difficulties occurring in the study of the more general problem, in which E is a set of not-necessarily-disjoint C-oriented polygons.
AB - Let be a set of C-oriented disjoint segments in R is a given finite set of orientations that spans the plane, and let s and t be two points. We seek a minimum-link C-oriented tour of E, that is, a polygonal path from s to t that visits the segments of E in order, such that, the orientations of its edges are in C and their number is minimum. We present an algorithm for computing such a tour in time. This problem already captures most of the difficulties occurring in the study of the more general problem, in which E is a set of not-necessarily-disjoint C-oriented polygons.
UR - http://www.scopus.com/inward/record.url?scp=85161419174&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-30448-4_18
DO - 10.1007/978-3-031-30448-4_18
M3 - Conference contribution
AN - SCOPUS:85161419174
SN - 9783031304477
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 247
EP - 262
BT - Algorithms and Complexity - 13th International Conference, CIAC 2023, Proceedings
A2 - Mavronicolas, Marios
PB - Springer Science and Business Media Deutschland GmbH
T2 - 13th International Symposium on Algorithms and Complexity, CIAC 2023
Y2 - 13 June 2023 through 16 June 2023
ER -