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 #.

