Alternating paths through disjoint line segments

Information Processing Letters

Volumn 87, Issue 6, 2003, Pages 287-294

  Hoffmann, Michael ^a   Tóth, Csaba D ^b  

^a ETH ZURICH   (Switzerland)

^b University of California   (United States)

Author keywords

Computational geometry; Hamiltonian circuit; Line segment; Visibility graphs

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; GRAPH THEORY; HAMILTONIANS;

LINE SEGMENTS;

DATA PROCESSING;

EID: 0041466327     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00349-1     Document Type: Article

References (7)

1. Demaine E.D., O'Rourke J. Open problems from CCCG'99. Electronic Proc. 11th Canadian Conf. on Computational Geometry, Vancouver, BC. 1999.
2. Hoffmann M., Tóth Cs.D. Segment endpoint visibility graphs are Hamiltonian. Comput. Geom. Theory Appl. 26:(1):2003;47-68.
3. Rappaport D. Computing simple circuits from a set of line segments is NP-complete. SIAM J. Comput. 18:(6):1989;1128-1139.
4. Rappaport D., Imai H., Toussaint G.T. Computing simple circuits from a set of line segments. Discrete Comput. Geom. 5:(3):1990;289-304.
5. Urabe M., Watanabe M. On a counterexample to a conjecture of Mirzaian. Comput. Geom. Theory Appl. 2:(1):1992;51-53.
6. Urrutia J. Algunos problemas abiertos. Actas de los IX Encuentros de Geometría Computacional, Girona. 2001;. (in Spanish).
7. Urrutia J. Open problems in computational geometry. Proc. Latin Amer. Symp. Theoret. Informatics, Cancún. Lecture Notes in Comp. Sci. 2286:2002;4-11 Springer-Verlag, Berlin.