arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2305.01467cs.CG
收藏

将多边形边界上的每一点折叠到一个点

Folding Every Point on a Polygon Boundary to a Point

Nattawut Phetmak, Jittat Fakcharoenphol

AI总结:

该研究扩展了计算折纸中仅折叠多边形顶点的问题,提出将凸多边形边界所有点折叠到内部点并求解无折痕安全区域,证明了抛物线边界区域交集的结构性质,设计出线性时间算法,并得出安全区域弧数可通过多边形直线骨架确定的结构结论。

摘要:

我们研究计算折纸领域的一个问题。给定一张凸多边形P形状的纸以及位于其内部的点f,将P边界上的每一点都折叠到f,并计算出一个不受折叠影响的安全区域,即没有折痕的区域。该问题是Akitaya、Ballinger、Demaine、Hull和Schmidt[CCCG'21]提出的仅折叠多边形顶点问题的扩展版本。为了找到该区域,我们证明了抛物线边界区域交集的结构性质,并利用这些性质设计了一个线性时间算法。我们还证明了一个关于安全区域复杂度作为点f位置变量的结构结果,即安全区域的弧数可以通过多边形P的straight skeleton(直线骨架)来确定。

英文摘要:

We consider a problem in computational origami. Given a piece of paper as a convex polygon $P$ and a point $f$ located within, fold every point on a boundary of $P$ to $f$ and compute a region that is safe from folding, i.e., the region with no creases. This problem is an extended version of a problem by Akitaya, Ballinger, Demaine, Hull, and Schmidt~[CCCG'21] that only folds corners of the polygon. To find the region, we prove structural properties of intersections of parabola-bounded regions and use them to devise a linear-time algorithm. We also prove a structural result regarding the complexity of the safe region as a variable of the location of point $f$, i.e., the number of arcs of the safe region can be determined using the straight skeleton of the polygon $P$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑