It was shown recently that the segment endpoint visibility graph Vis(S) of any set S of n disjoint line segments in the plane admits an alternating path of length θ(log n), and this bound is best possible apart from a constant factor. This paper focuses on the variant of the problem where S is a set of n disjoint axis-parallel line segments. We show that the length of a longest alternating path in the worst case is θ(√n). We also present an O(n2.5) time algorithm to find an alternating path of length Ω(√n). Finally, we consider sets of axis-parallel segments where the extensions of no two segments meet in the free space double-struck E sign2\∪ S, and show that in that case all the segments can be included in a common alternating path. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Tóth, C. D. (2003). Alternating paths along orthogonal segments. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2748, 389–400. https://doi.org/10.1007/978-3-540-45078-8_34
Mendeley helps you to discover research relevant for your work.