支持规则多边形
Supporting Ruled Polygons
摘要:
我们探讨了几个问题有关的规则多边形。给定多边形$P$的一条划线,考虑由该划线诱导的$P$的Reeb图.我们定义了$P$的Reeb复杂度,它大致等于支持$P$所需的最小点数。我们给出了渐近紧界的Reeb复杂性,也紧到一个小的附加常数。当限制到一组并行规则,我们表明,Reeb复杂性可以计算在多项式时间。
英文摘要:
We explore several problems related to ruled polygons. Given a ruling of a polygon $P$, we consider the Reeb graph of $P$ induced by the ruling. We define the Reeb complexity of $P$, which roughly equates to the minimum number of points necessary to support $P$. We give asymptotically tight bounds on the Reeb complexity that are also tight up to a small additive constant. When restricted to the set of parallel rulings, we show that the Reeb complexity can be computed in polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。