arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.6015math.GTcs.CGcs.DS
收藏

一种计算$E^d$中闭曲面不可约三角剖分的快速算法

A fast algorithm for computing irreducible triangulations of closed surfaces in $E^d$

Suneeta Ramaswami, Marcelo Siqueira

AI总结:

本研究提出一种快速算法,可从$E^d$中定向紧致闭曲面的任意三角剖分计算其不可约三角剖分,正亏格下时间复杂度优于现有结果,零亏格下达到线性时间最优,空间复杂度均为$Θ(n)$。

摘要:

我们提出了一种快速算法,可从$E^d$中定向、连通、无边界的紧致曲面$S$的任意给定三角剖分$T$出发,计算其不可约三角剖分$T'$。若$S$的亏格$g$为正,算法耗时$O(g^2+gn)$得到$T'$,其中$n$为$T$的三角形数量;否则可在$n$的线性时间内得到$T'$。后者的时间上界是最优的,前者的时间上界比当前已知最优上界提升了$(\text{lg } n / g)$倍。两种情况下,算法所需的内存空间均为$Θ(n)$。

英文摘要:

We give a fast algorithm for computing an irreducible triangulation $T^\prime$ of an oriented, connected, boundaryless, and compact surface $S$ in $E^d$ from any given triangulation $T$ of $S$. If the genus $g$ of $S$ is positive, then our algorithm takes $O(g^2+gn)$ time to obtain $T^\prime$, where $n$ is the number of triangles of $T$. Otherwise, $T^\prime$ is obtained in linear time in $n$. While the latter upper bound is optimal, the former upper bound improves upon the currently best known upper bound by a $(\lg n / g)$ factor. In both cases, the memory space required by our algorithm is in $Θ(n)$.

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

↑