Linking disjoint axis-parallel segments into a simple polygon is hard too
Rain JiangKai JiangMinghui Jiang
所有作者
Rain JiangKai JiangMinghui Jiang
文献摘要
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.