Dihedral bounds for mesh generation in high dimensions

Marshall Wayne Bern, L. Paul Chew, David Eppstein, and Jim Ruppert
Abstracts of the AMS 15:366, 1994
Proc. 6th Symp. Discrete Algorithms, ACM and SIAM, Jan 1995, pp. 189–196
Mathematical Reviews 95m:52031
http://www.ics.uci.edu/~eppstein/pubs/BerCheEpp-SODA-95.pdf

Cited by:

• Linear-size nonobtuse triangulation of polygons
• An aspect ratio bound for triangulating a $d$-grid cut by a hyperplane
• Triangulations
• Mesh generation
• Sliver exudation
• New Results on Geometric Spanners and Their Applications
• Lipschitzian crowded ball packings and Delaunay spheres
• Optimality and integer programming formulations of triangulations in general dimension
• Tiling 3D Euclidean space with acute tetrahedra
• Building space-time meshes over arbitrary spatial domains
• Generating well-shaped $d$-dimensional Delaunay meshes
• Application of the local nonobtuse tetrahedral refinement techniques near Fichera-like corners
• Gradient superconvergence on uniform simplicial partitions of polytopes