Approximating the maxmin-angle covering triangulation

DOI10.1016/0925-7721(95)00046-1zbMATH Open0869.68109OpenAlexW2046867377MaRDI QIDQ676589FDOQ676589

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

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

zbMATH Keywords

covering triangulations

Mathematics Subject Classification ID

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

Cites Work

• On the Angle Condition in the Finite Element Method
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding a Covering Triangulation Whose Maximum Angle is Provably Small
• Approximating the maxmin-angle covering triangulation

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Angle covers: algorithms and complexity
• Approximating the maxmin-angle covering triangulation

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)