TY - CONF
AB - We show that a triangulation of a set of n points in the plane that minimizes the maximum angle can be computed in time O(n2 log n) and space O(n). In the same amount of time and space we can also handle the constrained case where edges are prescribed. The algorithm iteratively improves an arbitrary initial triangulation and is fairly easy to implement.
AU - Edelsbrunner, Herbert
AU - Tan, Tiow
AU - Waupotitsch, Roman
ID - 4071
SN - 978-0-89791-362-1
T2 - Proceedings of the 6th annual symposium on Computational geometry
TI - An O(n^2log n) time algorithm for the MinMax angle triangulation
ER -