将不相交的轴平行线段连接成一个简单的多边形也很困难
Linking disjoint axis-parallel segments into a simple polygon is hard too
摘要:
决定平面上一组不相交的轴平行线段是否可以通过在端点之间添加线段而连接成简单多边形(或简单多边形链)是NP难的。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。