{"day":"01","article_type":"original","publisher":"SIAM","year":"1993","date_published":"1993-06-01T00:00:00Z","publist_id":"2086","language":[{"iso":"eng"}],"intvolume":"        22","quality_controlled":"1","scopus_import":"1","title":"A quadratic time algorithm for the minmax length triangulation","main_file_link":[{"url":"https://epubs.siam.org/doi/10.1137/0222036"}],"oa_version":"None","issue":"3","acknowledgement":"The authors thank an anonymous referee for suggestions on the organization of this paper.","article_processing_charge":"No","month":"06","date_created":"2018-12-11T12:06:36Z","citation":{"apa":"Edelsbrunner, H., &#38; Tan, T. (1993). A quadratic time algorithm for the minmax length triangulation. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0222036 \">https://doi.org/10.1137/0222036 </a>","ista":"Edelsbrunner H, Tan T. 1993. A quadratic time algorithm for the minmax length triangulation. SIAM Journal on Computing. 22(3), 527–551.","chicago":"Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” <i>SIAM Journal on Computing</i>. SIAM, 1993. <a href=\"https://doi.org/10.1137/0222036 \">https://doi.org/10.1137/0222036 </a>.","ieee":"H. Edelsbrunner and T. Tan, “A quadratic time algorithm for the minmax length triangulation,” <i>SIAM Journal on Computing</i>, vol. 22, no. 3. SIAM, pp. 527–551, 1993.","ama":"Edelsbrunner H, Tan T. A quadratic time algorithm for the minmax length triangulation. <i>SIAM Journal on Computing</i>. 1993;22(3):527-551. doi:<a href=\"https://doi.org/10.1137/0222036 \">10.1137/0222036 </a>","mla":"Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” <i>SIAM Journal on Computing</i>, vol. 22, no. 3, SIAM, 1993, pp. 527–51, doi:<a href=\"https://doi.org/10.1137/0222036 \">10.1137/0222036 </a>.","short":"H. Edelsbrunner, T. Tan, SIAM Journal on Computing 22 (1993) 527–551."},"status":"public","page":"527 - 551","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","type":"journal_article","date_updated":"2022-03-30T07:43:13Z","volume":22,"publication_identifier":{"issn":["0097-5397"]},"_id":"4042","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"first_name":"Tiow","full_name":"Tan, Tiow","last_name":"Tan"}],"doi":"10.1137/0222036 ","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 0(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_status":"published","publication":"SIAM Journal on Computing"}