{"year":"1990","status":"public","extern":"1","_id":"4071","publication":"Proceedings of the 6th annual symposium on Computational geometry","type":"conference","day":"01","citation":{"apa":"Edelsbrunner, H., Tan, T., &#38; Waupotitsch, R. (1990). An O(n^2log n) time algorithm for the MinMax angle triangulation. In <i>Proceedings of the 6th annual symposium on Computational geometry</i> (pp. 44–52). Berkley, CA, United States: ACM. <a href=\"https://doi.org/10.1145/98524.98535\">https://doi.org/10.1145/98524.98535</a>","chicago":"Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation.” In <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>, 44–52. ACM, 1990. <a href=\"https://doi.org/10.1145/98524.98535\">https://doi.org/10.1145/98524.98535</a>.","ista":"Edelsbrunner H, Tan T, Waupotitsch R. 1990. An O(n^2log n) time algorithm for the MinMax angle triangulation. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 44–52.","ieee":"H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2log n) time algorithm for the MinMax angle triangulation,” in <i>Proceedings of the 6th annual symposium on Computational geometry</i>, Berkley, CA, United States, 1990, pp. 44–52.","mla":"Edelsbrunner, Herbert, et al. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation.” <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>, ACM, 1990, pp. 44–52, doi:<a href=\"https://doi.org/10.1145/98524.98535\">10.1145/98524.98535</a>.","short":"H. Edelsbrunner, T. Tan, R. Waupotitsch, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52.","ama":"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>"},"language":[{"iso":"eng"}],"publication_status":"published","author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner"},{"last_name":"Tan","first_name":"Tiow","full_name":"Tan, Tiow"},{"last_name":"Waupotitsch","full_name":"Waupotitsch, Roman","first_name":"Roman"}],"article_processing_charge":"No","month":"01","quality_controlled":"1","oa_version":"None","publisher":"ACM","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/98524.98535"}],"publist_id":"2052","conference":{"location":"Berkley, CA, United States","end_date":"1990-06-09","name":"SCG: Symposium on Computational Geometry","start_date":"1990-06-07"},"date_updated":"2022-02-22T08:56:42Z","date_created":"2018-12-11T12:06:46Z","page":"44 - 52","publication_identifier":{"isbn":["978-0-89791-362-1"]},"date_published":"1990-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"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."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","title":"An O(n^2log n) time algorithm for the MinMax angle triangulation","doi":"10.1145/98524.98535"}