Computing Simple Circuits from a Set of Line Segments is NP-Complete

David Rappaport. Computing Simple Circuits from a Set of Line Segments is NP-Complete. In Symposium on Computational Geometry. pages 322-330, 1987. [doi]

Abstract

Abstract is missing.