  Deciding whether a family of disjoint axis-parallel 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.
