An O(n^2 log n) time algorithm for the MinMax angle triangulation
Herbert Edelsbrunner
Tan, Tiow Seng
Waupotitsch, Roman
It is shown 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). The algorithm is fairly easy to implement and is based on the edge-insertion scheme that iteratively improves an arbitrary initial triangulation. It can be extended to the case where edges are prescribed, and, within the same time- and space-bounds, it can lexicographically minimize the sorted angle vector if the point set is in general position. Experimental results on the efficiency of the algorithm and the quality of the triangulations obtained are included.
Society for Industrial and Applied Mathematics
1992
info:eu-repo/semantics/article
doc-type:article
text
http://purl.org/coar/resource_type/c_6501
https://research-explorer.app.ist.ac.at/record/4043
Edelsbrunner H, Tan T, Waupotitsch R. An O(n^2 log n) time algorithm for the MinMax angle triangulation. <i>SIAM Journal on Scientific Computing</i>. 1992;13(4):994-1008. doi:<a href="https://doi.org/10.1137/0913058">10.1137/0913058</a>
info:eu-repo/semantics/altIdentifier/doi/10.1137/0913058
info:eu-repo/semantics/closedAccess