Linking disjoint segments into a simple polygon is hard
Abstract
Deciding whether a family of disjoint line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-hard.
- Publication:
-
arXiv e-prints
- Pub Date:
- August 2021
- DOI:
- 10.48550/arXiv.2108.12812
- arXiv:
- arXiv:2108.12812
- Bibcode:
- 2021arXiv210812812J
- Keywords:
-
- Computer Science - Computational Geometry;
- Computer Science - Computational Complexity
- E-Print:
- Added a postscript and two more references