4.5 Article

Sliver exudation

Journal

JOURNAL OF THE ACM
Volume 47, Issue 5, Pages 883-904

Publisher

ASSOC COMPUTING MACHINERY
DOI: 10.1145/355483.355487

Keywords

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

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available