Computing simple circuits from a set of line segments is NP-complete
Proceedings of the third annual symposium on Computational geometry - SCG ’87
Long non-crossing configurations in the plane