Approximating the maxmin-angle covering triangulation

DOI10.1016/0925-7721(95)00046-1MaRDI QIDQ676589zbMATH OpenOpenAlexFDO

Authors Scott A. Mitchell

Publication date 18 March 1997

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0925-7721(95)00046-1

zbMATH Keywords

covering triangulations

Mathematics Subject Classification ID

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

Recommendations

• Finding a Covering Triangulation Whose Maximum Angle is Provably Small
• An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
• TRIANGULATING POLYGONS WITHOUT LARGE ANGLES

Cites work

• scientific article; zbMATH DE number 437532 (Why is no real title available?)
• scientific article; zbMATH DE number 3633698 (Why is no real title available?)
• scientific article; zbMATH DE number 741009 (Why is no real title available?)
• scientific article; zbMATH DE number 1182913 (Why is no real title available?)
• Approximating the maxmin-angle covering triangulation
• Finding a Covering Triangulation Whose Maximum Angle is Provably Small
• On the Angle Condition in the Finite Element Method

Cited in

(4)

• scientific article; zbMATH DE number 7760172 (Why is no real title available?)
• scientific article; zbMATH DE number 1953077 (Why is no real title available?)
• Angle covers: algorithms and complexity
• Approximating the maxmin-angle covering triangulation

Describes a project that uses

Uses Software

• Voronoi

This page was built for publication: Approximating the maxmin-angle covering triangulation

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