Triangulating polygons without large angles
Marshall Wayne Bern,
David P. Dobkin,
and David Eppstein
Int. J. Computational Geometry & Applications 5(1–2):171–192, 1995
Proc. 8th Symp. Computational Geometry, ACM, Jun 1992, pp. 222–231
Mathematical Reviews 96e:68124
http://www.ics.uci.edu/~eppstein/pubs/BerDobEpp-IJCGA-95.ps.gz
Cited by:
- Computational geometry: a retrospective
- Quality mesh generation in three dimensions
- Mesh generation with provable quality bounds
- Approximating the maxmin-angle covering triangulation
- Refining a triangulation of a planar straight-line graph to eliminate large angles
- A discussion on the triangulation refinement problem
- Optimal Two-Dimensional Triangulations
- An optimal bound for high-quality conforming triangulations
- Linear-size nonobtuse triangulation of polygons
- An upper bound for conforming Delaunay triangulations
- A parallel solution strategy for irregular dynamic problems
- Robust distortion metric for quadratic triangular 2d finite elements
- Tools for triangulations and tetrahedralizations and constructing functions defined over them
- Quality mesh generation in higher dimensions
- On computing and drawing maxmin-height covering triangulation
- Surface triangulation: a survey
- Mid-node admissible spaces for quadratic triangular arbitrarily curved 2D finite elements
- Approximating uniform triangular meshes in polygons
- Higher order Delaunay triangulations
- Approximating uniform triangular meshes for spheres
- Algorithms for Geometric Shortest Paths Along Routes
- Robust incremental polygon triangulation for surface rendering
- Geometric Decompositions and Networks: Approximation Bounds and Algorithms
