Sliver exudation

A silver 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. Silvers 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 silvers. We also give an algorithm to compute such a weight assignment.

[1]  David Eppstein,et al.  Dihedral bounds for mesh generation in high dimensions , 1995, SODA '95.

[2]  Tiow Seng Tan,et al.  An upper bound for conforming Delaunay triangulations , 1992, SCG '92.

[3]  Scott A. Mitchell,et al.  Quality mesh generation in three dimensions , 1992, SCG '92.

[4]  Bernd Sturmfels,et al.  Constructions and complexity of secondary polytopes , 1990 .

[5]  I. M. Gelʹfand,et al.  Discriminants, Resultants, and Multidimensional Determinants , 1994 .

[6]  Jim Ruppert,et al.  A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation , 1995, J. Algorithms.

[7]  Jonathan Richard Shewchuk,et al.  Tetrahedral mesh generation by Delaunay refinement , 1998, SCG '98.

[8]  V. T. Rajan.  Optimality of the Delaunay triangulation in ℝd , 1994, Discret. Comput. Geom..

[9]  Georges Voronoi.  Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs. , 1908 .

[10]  Gary L. Miller,et al.  A Delaunay based numerical method for three dimensions: generation, formulation, and partition , 1995, STOC '95.

[11]  William H. Frey,et al.  An apporach to automatic three‐dimensional finite element mesh generation , 1985 .

[12]  Barry Joe,et al.  Delaunay versus max‐min solid angle triangulations for three‐dimensional mesh generation , 1991 .

[13]  Dafna Talmor,et al.  Well-Spaced Points for Numerical Methods , 1997 .

[14]  Tiow Seng Tan,et al.  An upper bound for conforming Delaunay triangulations , 1992, SCG '92.

[15]  Kokichi Sugihara,et al.  On good triangulations in three dimensions , 1992, Int. J. Comput. Geom. Appl..

[16]  B. Joe,et al.  Relationship between tetrahedron shape measures , 1994 .

[17]  Kokichi Sugihara,et al.  On good triangulations in three dimensions , 1991, SMA '91.

[18]  L. Paul Chew,et al.  Guaranteed-quality Delaunay meshing in 3D (short version) , 1997, SCG '97.

[19]  David Eppstein,et al.  Provably good mesh generation , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[20]  Alan M. Frieze,et al.  Separator based parallel divide and conquer in computational geometry , 1992, SPAA '92.

[21]  Philippe G. Ciarlet,et al.  The finite element method for elliptic problems , 2002, Classics in applied mathematics.