An O(n^2log n) time algorithm for the MinMax angle triangulation Edelsbrunner, Herbert ; https://orcid.org/0000-0002-9823-6833 Tan, Tiow Waupotitsch, Roman 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. ACM 1990 info:eu-repo/semantics/conferenceObject doc-type:conferenceObject text http://purl.org/coar/resource_type/c_5794 https://research-explorer.ista.ac.at/record/4071 Edelsbrunner H, Tan T, Waupotitsch R. An O(n^2log n) time algorithm for the MinMax angle triangulation. In: <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>. ACM; 1990:44-52. doi:<a href="https://doi.org/10.1145/98524.98535">10.1145/98524.98535</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1145/98524.98535 info:eu-repo/semantics/altIdentifier/isbn/978-0-89791-362-1 info:eu-repo/semantics/closedAccess