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

三维多面体的直边形

Straight Skeletons of Three-Dimensional Polyhedra

Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman

摘要:

本文研究了三维多面体的直骨架。我们首先解决基于体素的多面体(多立方体),形成的立方体(轴对齐)体素的集合的联合。我们分析的方式,在其中的骨架可能会相交的多面体的每个体素,并表明,骨架可以通过一个简单的体素扫描算法,以恒定的时间每体素。此外,我们描述了一个更复杂的算法为直骨架的体素为基础的多面体,这需要的时间成比例的面积的直骨架的表面,而不是体积的多面体。我们还考虑了更一般的多面体与轴平行的边和面,并表明,任何n-顶点多面体的这种类型有一个直骨架O(n^2)的功能。我们提供了构造直骨架的算法,运行时间为O(min(n^2 log n,k log^{O(1)} n)),其中k是输出复杂度。其次,我们讨论一般非凸多面体的直骨架。我们证明了一般多面体的直骨架在最坏情况下具有超二次复杂性。最后,我们报告的一般情况下,一个简单的算法的实现。

英文摘要:

This paper studies the straight skeleton of polyhedra in three dimensions. We first address voxel-based polyhedra (polycubes), formed as the union of a collection of cubical (axis-aligned) voxels. We analyze the ways in which the skeleton may intersect each voxel of the polyhedron, and show that the skeleton may be constructed by a simple voxel-sweeping algorithm taking constant time per voxel. In addition, we describe a more complex algorithm for straight skeletons of voxel-based polyhedra, which takes time proportional to the area of the surfaces of the straight skeleton rather than the volume of the polyhedron. We also consider more general polyhedra with axis-parallel edges and faces, and show that any n-vertex polyhedron of this type has a straight skeleton with O(n^2) features. We provide algorithms for constructing the straight skeleton, with running time O(min(n^2 log n, k log^{O(1)} n)) where k is the output complexity. Next, we discuss the straight skeleton of a general nonconvex polyhedron. We show that it has an ambiguity issue, and suggest a consistent method to resolve it. We prove that the straight skeleton of a general polyhedron has a superquadratic complexity in the worst case. Finally, we report on an implementation of a simple algorithm for the general case.

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

↑