TRIANGULATING POLYGONS WITHOUT LARGE ANGLES

DOI10.1142/S0218195995000106MaRDI QIDQ4698357zbMATH OpenFDO

Authors David P. Dobkin, David Eppstein, M. W. Bern

Publication date 17 May 1995

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

zbMATH Keywords

computational geometrytriangulationmesh generation

Mathematics Subject Classification ID

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

Recommendations

• POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
• Linear-size nonobtuse triangulation of polygons
• Nonobtuse triangulation of polygons
• Nonobtuse triangulations of PSLGs

Cited in

(13)

• Computing and Combinatorics
• An efficient algorithm for shortest paths in vertical and horizontal segments
• Ear-slicing and quality triangulation
• Triangulating a convex polygon with fewer number of non-standard bars
• Approximating uniform triangular meshes in polygons.
• An upper bound for conforming Delaunay triangulations
• Triangulation refinement by using edge subdivision
• Triangulating a polygon in parallel
• Nonobtuse triangulations of PSLGs
• POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
• Meshes preserving minimum feature size
• Higher order Delaunay triangulations
• Linear-size nonobtuse triangulation of polygons

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698357)