A quadratic time algorithm for the minmax length triangulation
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.
Download
No fulltext has been uploaded. References only!
Conference Paper
| Published
| English
Scopus indexed
Author
Edelsbrunner, HerbertISTA 
;
Tan, Tiow
;
Tan, TiowAbstract
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.
Publishing Year
Date Published
1991-12-01
Proceedings Title
32nd Annual Symposium of Foundations of Computer Science
Page
414 - 423
Conference
FOCS: Foundations of Computer Science
Conference Location
San Juan, PR, United States of America
Conference Date
1991-10-01 – 1991-10-04
IST-REx-ID
Cite this
Edelsbrunner H, Tan T. A quadratic time algorithm for the minmax length triangulation. In: 32nd Annual Symposium of Foundations of Computer Science. IEEE; 1991:414-423. doi:10.1109/SFCS.1991.185400
Edelsbrunner, H., & Tan, T. (1991). A quadratic time algorithm for the minmax length triangulation. In 32nd Annual Symposium of Foundations of Computer Science (pp. 414–423). San Juan, PR, United States of America: IEEE. https://doi.org/10.1109/SFCS.1991.185400
Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” In 32nd Annual Symposium of Foundations of Computer Science, 414–23. IEEE, 1991. https://doi.org/10.1109/SFCS.1991.185400.
H. Edelsbrunner and T. Tan, “A quadratic time algorithm for the minmax length triangulation,” in 32nd Annual Symposium of Foundations of Computer Science, San Juan, PR, United States of America, 1991, pp. 414–423.
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.
Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” 32nd Annual Symposium of Foundations of Computer Science, IEEE, 1991, pp. 414–23, doi:10.1109/SFCS.1991.185400.
Google Scholar