{"oa_version":"None","abstract":[{"lang":"eng","text":"It is shown that a triangulation of a set of n points in the plane that minimizes the maximum edge length can be computed in time O(n2). The algorithm is reasonably easy to implement and is based on the theorem that there is a triangulation with minmax edge length that contains the relative neighborhood graph of the points as a subgraph. With minor modifications the algorithm works for arbitrary normed metrics."}],"publication":"32nd Annual Symposium of Foundations of Computer Science","publication_status":"published","title":"A quadratic time algorithm for the minmax length triangulation","scopus_import":"1","quality_controlled":"1","doi":"10.1109/SFCS.1991.185400","author":[{"orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"last_name":"Tan","full_name":"Tan, Tiow","first_name":"Tiow"}],"conference":{"start_date":"1991-10-01","end_date":"1991-10-04","location":"San Juan, PR, United States of America","name":"FOCS: Foundations of Computer Science"},"_id":"4055","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/185400"}],"language":[{"iso":"eng"}],"type":"conference","extern":"1","publist_id":"2069","date_updated":"2022-02-28T15:51:45Z","date_published":"1991-12-01T00:00:00Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","day":"01","page":"414 - 423","status":"public","year":"1991","publisher":"IEEE","date_created":"2018-12-11T12:06:40Z","month":"12","citation":{"chicago":"Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” In <i>32nd Annual Symposium of Foundations of Computer Science</i>, 414–23. IEEE, 1991. <a href=\"https://doi.org/10.1109/SFCS.1991.185400\">https://doi.org/10.1109/SFCS.1991.185400</a>.","ista":"Edelsbrunner H, Tan T. 1991. A quadratic time algorithm for the minmax length triangulation. 32nd Annual Symposium of Foundations of Computer Science. FOCS: Foundations of Computer Science, 414–423.","apa":"Edelsbrunner, H., &#38; Tan, T. (1991). A quadratic time algorithm for the minmax length triangulation. In <i>32nd Annual Symposium of Foundations of Computer Science</i> (pp. 414–423). San Juan, PR, United States of America: IEEE. <a href=\"https://doi.org/10.1109/SFCS.1991.185400\">https://doi.org/10.1109/SFCS.1991.185400</a>","ama":"Edelsbrunner H, Tan T. A quadratic time algorithm for the minmax length triangulation. In: <i>32nd Annual Symposium of Foundations of Computer Science</i>. IEEE; 1991:414-423. doi:<a href=\"https://doi.org/10.1109/SFCS.1991.185400\">10.1109/SFCS.1991.185400</a>","mla":"Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” <i>32nd Annual Symposium of Foundations of Computer Science</i>, IEEE, 1991, pp. 414–23, doi:<a href=\"https://doi.org/10.1109/SFCS.1991.185400\">10.1109/SFCS.1991.185400</a>.","short":"H. Edelsbrunner, T. Tan, in:, 32nd Annual Symposium of Foundations of Computer Science, IEEE, 1991, pp. 414–423.","ieee":"H. Edelsbrunner and T. Tan, “A quadratic time algorithm for the minmax length triangulation,” in <i>32nd Annual Symposium of Foundations of Computer Science</i>, San Juan, PR, United States of America, 1991, pp. 414–423."},"article_processing_charge":"No"}