Alternating paths through disjoint line segments

Authors:
Michael Hoffmann;Csaba D. Tóth
Affiliations:
Institute for Theoretical Computer Science, ETH Zürich, CH-8092, Switzerland;Department of Computer Science, University of California at Santa Barbara, CA
Venue:
Information Processing Letters
Year:
2003

Citing 5
Cited 5

Computing simple circuits from a set of line segments is NP-complete

SIAM Journal on Computing
Computing simple circuits from a set of line segments

Discrete & Computational Geometry
On a counterexample to a conjecture of Mirzaian

Computational Geometry: Theory and Applications
Open Problems in Computational Geometry

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Segment endpoint visibility graphs are Hamiltonian

Computational Geometry: Theory and Applications - Special issue on the thirteenth canadian conference on computational geometry - CCCG'01

Pointed and colored binary encompassing trees

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Encompassing colored planar straight line graphs

Computational Geometry: Theory and Applications
Augmenting the connectivity of geometric graphs

Computational Geometry: Theory and Applications
Compatible geometric matchings

Computational Geometry: Theory and Applications
Unsolved problems in visibility graphs of points, segments, and polygons

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.90

Visualization

Abstract

We show that every segment endpoint visibility graph on n disjoint line segments in the plane admits an alternating path of length Ω(log n), and this bound is optimal apart from a constant factor.