Finding a Covering Triangulation Whose Maximum Angle is Provably Small

DOI10.1142/S021819599700003XMaRDI QIDQ4340958zbMATH OpenOpenAlexFDO

Authors Scott A. Mitchell

Publication date 16 June 1997

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

Full work available at URL https://doi.org/10.1142/s021819599700003x

zbMATH Keywords

covering triangulation

Mathematics Subject Classification ID

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

Recommendations

• Approximating the maxmin-angle covering triangulation
• An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
• TRIANGULATING POLYGONS WITHOUT LARGE ANGLES

Cited in

(2)

• An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
• Approximating the maxmin-angle covering triangulation

This page was built for publication: Finding a Covering Triangulation Whose Maximum Angle is Provably Small

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