论文信息 - Alternating paths through disjoint line segments

Alternating paths through disjoint line segments

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.

Csaba D. Tóth | Michael Hoffmann

[1] Csaba D. Tóth,et al. Segment endpoint visibility graphs are Hamiltonian , 2001, Comput. Geom..

[2] Jorge Urrutia. Open Problems in Computational Geometry , 2002, LATIN.

[3] Mamoru Watanabe,et al. On a Counterexample to a Conjecture of Mirzaian , 1992, Comput. Geom..

[4] Godfried T. Toussaint,et al. Computing simple circuits from a set of line segments , 1990, Discret. Comput. Geom..

[5] David Rappaport. Computing Simple Circuits from a Set of Line Segments is NP-Complete , 1989, SIAM J. Comput..