4.5 Article

Sliver exudation

期刊

JOURNAL OF THE ACM
卷 47, 期 5, 页码 883-904

出版社

ASSOC COMPUTING MACHINERY
DOI: 10.1145/355483.355487

关键词

algorithms; algorithms; computational geometry; mesh generation; mesh quality; slivers; tetrahedral meshes; (weighted) Delaunay triangulations

向作者/读者索取更多资源

A sliver is a tetrahedron whose four vertices lie close to a plane and whose orthogonal projection to that plane is a convex quadrilateral with no short edge. Slivers are notoriously common in 3-dimensional Delaunay triangulations even for well-spaced point sets. We show that, if the Delaunay triangulation has the ratio property introduced in Miller et al. [1995], then there is an assignment of weights so the weighted Delaunay triangulation contains no slivers. We also give an algorithm to compute such a weight assignment.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据