TRIANGULATING POLYGONS WITHOUT LARGE ANGLES

DOI10.1142/S0218195995000106zbMATH Open0818.68139MaRDI QIDQ4698357FDOQ4698357

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

Publication date: 17 May 1995

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

Recommendations

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

zbMATH Keywords

computational geometrytriangulationmesh generation

Mathematics Subject Classification ID

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

Cited In (12)

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

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)