Linking disjoint axis-parallel segments into a simple polygon is hard too
Computational Geometry
2021-09-07 v1 Computational Complexity
Abstract
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.
Keywords
Cite
@article{arxiv.2109.02156,
title = {Linking disjoint axis-parallel segments into a simple polygon is hard too},
author = {Rain Jiang and Kai Jiang and Minghui Jiang},
journal= {arXiv preprint arXiv:2109.02156},
year = {2021}
}
Comments
Strengthens the results in arXiv:2108.12812