TRIANGULATING POLYGONS WITHOUT LARGE ANGLES

DOI10.1142/S0218195995000106zbMath0818.68139MaRDI QIDQ4698357

David Eppstein, David P. Dobkin, Marshall W. Bern

Publication date: 17 May 1995

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

triangulationmesh generationcomputational geometry

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (8)

Higher order Delaunay triangulations ⋮ Nonobtuse triangulations of PSLGs ⋮ Linear-size nonobtuse triangulation of polygons ⋮ An efficient algorithm for shortest paths in vertical and horizontal segments ⋮ Meshes Preserving Minimum Feature Size ⋮ Triangulating a convex polygon with fewer number of non-standard bars ⋮ An upper bound for conforming Delaunay triangulations ⋮ Approximating uniform triangular meshes in polygons.

This page was built for publication: TRIANGULATING POLYGONS WITHOUT LARGE ANGLES