具有Steiner点的Hamilton四面体化
Hamiltonian Tetrahedralizations with Steiner Points
摘要:
设$S$是三维空间中的一组$n$点。$S$的四面体化$\mathcal{T}$是一组内部不相交的四面体,其顶点在$S$上,在其内部不包含$S$的点,并且使得它们的并集是$S$的凸包。给定$\mathcal{T}$,$D_\mathcal{T}$被定义为具有$\mathcal{T}$的四面体作为顶点集的图,其中两个四面体相邻,如果它们共享一个面。如果$D_\mathcal{T}$有一条Hamilton路,则称$\mathcal{T}$是Hamilton的,令$m$为$S$的凸包顶点数.证明了在$S$的凸包内部至多增加$\lfloor \frac{m-2}{2} \rfloor$ Steiner点,就可以得到一个允许Hamilton四面体化的点集.给出了一个获取这些点的$O(m^{3/2}) + O(n \log n)$时间算法。我们还表明,所有的点集,最多20个凸包点承认一个哈密顿四面体化没有添加任何Steiner点。最后,我们展示了一组84点,不承认一个哈密顿四面体,其中所有四面体共享一个顶点。
英文摘要:
Let $S$ be a set of $n$ points in 3-dimensional space. A tetrahedralization $\mathcal{T}$ of $S$ is a set of interior disjoint tetrahedra with vertices on $S$, not containing points of $S$ in their interior, and such that their union is the convex hull of $S$. Given $\mathcal{T}$, $D_\mathcal{T}$ is defined as the graph having as vertex set the tetrahedra of $\mathcal{T}$, two of which are adjacent if they share a face. We say that $\mathcal{T}$ is Hamiltonian if $D_\mathcal{T}$ has a Hamiltonian path. Let $m$ be the number of convex hull vertices of $S$. We prove that by adding at most $\lfloor \frac{m-2}{2} \rfloor$ Steiner points to interior of the convex hull of $S$, we can obtain a point set that admits a Hamiltonian tetrahedralization. An $O(m^{3/2}) + O(n \log n)$ time algorithm to obtain these points is given. We also show that all point sets with at most 20 convex hull points admit a Hamiltonian tetrahedralization without the addition of any Steiner points. Finally we exhibit a set of 84 points that does not admit a Hamiltonian tetrahedralization in which all tetrahedra share a vertex.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。