Linking disjoint segments into a simple polygon is hard

08/29/2021

∙

by   Rain Jiang, et al.

∙

0

∙

share

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.