Title: Dihedral Bounds for Mesh Generation in High Dimensions


Abstract:

   We show that any set of n points in R^d has a Steiner Delaunay
   triangulation with O(n^ceiling(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-epsilon degrees or the minimum
   dihedral to measure at least epsilon.

<a href="http://www.ics.uci.edu/~eppstein/dihedrals.ps.Z"> full paper </a>