Alternating paths through disjoint line segments
Authors:
- 1 September 2003
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 87 (6) , 287-294
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Segment endpoint visibility graphs are HamiltonianComputational Geometry, 2003
- On a counterexample to a conjecture of MirzaianComputational Geometry, 1992
- Computing simple circuits from a set of line segmentsDiscrete & Computational Geometry, 1990
- Computing Simple Circuits from a Set of Line Segments is NP-CompleteSIAM Journal on Computing, 1989