Computing Simple Circuits from a Set of Line Segments is NP-Complete
- 1 December 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (6) , 1128-1139
- https://doi.org/10.1137/0218075
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Computing simple circuits from a set of line segmentsDiscrete & Computational Geometry, 1990
- Uniqueness of Orthogonal Connect-the-DotsPublished by Elsevier ,1988
- Computing Monotone Simple Circuits in the PlanePublished by Elsevier ,1988
- Connect-the-dots: A new heuristicComputer Vision, Graphics, and Image Processing, 1987
- Rectilinear planar layouts and bipolar orientations of planar graphsDiscrete & Computational Geometry, 1986
- Computational complexity of art gallery problemsIEEE Transactions on Information Theory, 1986
- Geometric structures for three-dimensional shape representationACM Transactions on Graphics, 1984
- Some NP-hard polygon decomposition problemsIEEE Transactions on Information Theory, 1983
- Hamilton Paths in Grid GraphsSIAM Journal on Computing, 1982
- The Planar Hamiltonian Circuit Problem is NP-CompleteSIAM Journal on Computing, 1976