MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Dihedral Bounds for Mesh Generation in High Dimensions (1995) [25 citations — 4 self]

by Marshall Bern ,  Paul Chew ,  David Eppstein ,  Jim Ruppert
Add To MetaCart

Abstract:

We show that any set of n points in R^d has a Steiner Delaunay triangulation with O(n #d/2# ) simplices, none of which has an obtuse dihedral angle. This result improves a naive bound of O(n^d). No bound depending only on n is possible if we require the maximum dihedral angle to measure at most 90 # -# or the minimum dihedral to measure at least #.

Citations

162 Mesh generation and optimal triangulation – Bern, Eppstein - 1992
159 Provably good mesh generation – Bern, Eppstein, et al. - 1994
95 Guaranteed-quality mesh generation for curved surfaces – Chew - 1993
74 Quality mesh generation in three dimensions – Mitchell, Vavasis - 1992
59 A new and simple algorithm for quality 2-dimensional mesh generation – Ruppert - 1993
48 Optimality of the Delaunay Triangulation in R d – Rajan - 1991
43 Linear-size nonobtuse triangulation of polygons – Bern, Mitchell, et al. - 1995
31 Nonobtuse triangulation of polygons – Baker, Grosse, et al. - 1988
30 On good triangulations in three dimensions – Dey, Bajaj, et al. - 1992
26 Polynomial-size nonobtuse triangulation of polygons – Bern, Eppstein - 1992
19 On the angle condition in the finite element method – Babuˇska, Aziz - 1976
19 Coping with inconsistencies: A new approach to produce quality triangulations of polygonal domains with holes – Melissaratos, Souvaine - 1992
18 Stable finite elements for problems with wild coefficients – Vavasis - 1993
17 A simple and relatively efficient triangulation of the n-cube – Haiman - 1991
10 Element Quality in Tetrahedral Meshes – Baker - 1989
6 The Stanley decomposition of the harmonic oscillator – Billera, Cushman, et al. - 1988
1 Orthogonal trees – Coxeter - 1991