Polynomial-size non-obtuse triangulation of polygons
Marshall Wayne Bern
and David Eppstein
Int. J. Computational Geometry & Applications 2(3):241–255, Sep 1992
Int. J. Computational Geometry & Applications 2(4):449–450, Dec 1992
Proc. 7th Symp. Computational Geometry, ACM, Jun 1991, pp. 342–350
Mathematical Reviews 94e:52016a
Mathematical Reviews 94e:52016b
http://www.ics.uci.edu/~eppstein/pubs/BerEpp-IJCGA-92.pdf
Cited by:
- Automatic mesh generation using the symmetric axis transformation of polygonal domains
- Computational geometry and computer graphics
- Refining a triangulation of a planar straight-line graph to eliminate large angles
- Optimal Two-Dimensional Triangulations
- An upper bound for conforming Delaunay triangulations
- An optimal bound for high-quality conforming triangulations
- Linear-size nonobtuse triangulation of polygons
- Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes for the finite element method
- Drawing the planar dual
- Locally-adaptive grid generation using quadtrees
- Best-case results for nearest-neighbor learning
- A geometric framework for machine learning
- A parallel solution strategy for irregular dynamic problems
- Computational Geometry: Algorithms and Applications
- Triangulations
- Trends and developments in computational geometry
- Tools for triangulations and tetrahedralizations and constructing functions defined over them
- Surface triangulation: a survey
- Biting: advancing front meets sphere packing
- Dynamic Load Balancing For Parallel Adaptive Mesh Refinement
- Object-based image editing
- Layer based solutions for constrained space-time meshing
- Modellierung der SOFC-Brennstoffzelle und die numerische Lösung mit einem adaptiven Full-Multigrid-Verfahren
- Global conformal surface parameterization
- Geometric properties of the local refinement in unstructured triangular meshes
