arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1112.4791cs.CGcs.DM
收藏

正交多面体的二次细化展开:Delta展开算法

Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm

Mirela Damian, Erik Demaine, Robin Flatland

摘要:

我们表明,每一个正交多面体同胚的领域可以展开没有重叠,而只使用多项式许多(正交)削减。相比之下,之前最好的结果使用了指数级的切割。更准确地说,给定一个有n个顶点的正交多面体,该算法只在通过顶点的坐标平面网格与多面体相交的地方切割多面体,以及每两个这样的网格平面之间的Theta(n^2)个附加坐标平面。

英文摘要:

We show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previous such result used exponentially many cuts. More precisely, given an orthogonal polyhedron with n vertices, the algorithm cuts the polyhedron only where it is met by the grid of coordinate planes passing through the vertices, together with Theta(n^2) additional coordinate planes between every two such grid planes.

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

↑