Sliver exudation
Top Cited Papers
- 1 September 2000
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 47 (5) , 883-904
- https://doi.org/10.1145/355483.355487
Abstract
A sliver is a tetrahedon 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 traingulation contains no slivers. We also give an algorithm to compute such a weight assignment.Keywords
This publication has 15 references indexed in Scilit:
- Incremental topological flipping works for regular triangulationsAlgorithmica, 1996
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh GenerationJournal of Algorithms, 1995
- Optimality of the Delaunay triangulation in ℝdDiscrete & Computational Geometry, 1994
- Relationship between tetrahedron shape measuresBIT Numerical Mathematics, 1994
- Provably good mesh generationJournal of Computer and System Sciences, 1994
- An upper bound for conforming Delaunay triangulationsDiscrete & Computational Geometry, 1993
- ON GOOD TRIANGULATIONS IN THREE DIMENSIONSInternational Journal of Computational Geometry & Applications, 1992
- Delaunay versus max-min solid angle triangulations for three-dimensional mesh generationInternational Journal for Numerical Methods in Engineering, 1991
- Constructions and complexity of secondary polytopesAdvances in Mathematics, 1990
- An apporach to automatic three‐dimensional finite element mesh generationInternational Journal for Numerical Methods in Engineering, 1985