平面区域的凸部分断面
Convex partial transversals of planar regions
摘要:
我们考虑的问题的测试,对于一组给定的平面区域$\cal R$和一个整数$k$,是否存在一个凸形的边界相交至少$k$区域的$\cal R$。我们提供了一个多项式时间算法的情况下,区域是不相交的线段与一个常数的方向。另一方面,我们证明了当区域是相交的轴对齐的矩形或3-定向线段时,问题是NP-难的。对于几个自然的中间类的形状(任意不相交的部分,相交2定向段)的问题仍然是开放的。
英文摘要:
We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, whether there exists a convex shape whose boundary intersects at least $k$ regions of $\cal R$. We provide a polynomial time algorithm for the case where the regions are disjoint line segments with a constant number of orientations. On the other hand, we show that the problem is NP-hard when the regions are intersecting axis-aligned rectangles or 3-oriented line segments. For several natural intermediate classes of shapes (arbitrary disjoint segments, intersecting 2-oriented segments) the problem remains open.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。