Publication | Closed Access
Dihedral bounds for mesh generation in high dimensions
54
Citations
15
References
1995
Year
Unknown Venue
Mathematical ProgrammingEngineeringGeometryPlanar GraphGeometry GenerationComputer-aided DesignStructural OptimizationMesh OptimizationDiscrete GeometryGomory-chvátal TheoryDiscrete MathematicsN PointsComputational GeometryNaive BoundGeometric ModelingGeometric Graph TheoryDihedral BoundsSteiner Delaunay TriangulationUnstructured Mesh GenerationGeometric AlgorithmNatural SciencesDelaunay Triangulation
We show that any set of n points in IR has a Steiner Delaunay triangulation with O(ndd/2e) simplices, none of which has an obtuse dihedral angle. This result improves a naive bound of O(n). No bound depending only on n is possible if we require the maximum dihedral angle to measure at most 90◦−2 or the minimum dihedral to measure
| Year | Citations | |
|---|---|---|
Page 1
Page 1