@inproceedings{4055,
abstract = {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.},
author = {Edelsbrunner, Herbert and Tan, Tiow},
booktitle = {32nd Annual Symposium of Foundations of Computer Science},
location = {San Juan, PR, United States of America},
pages = {414 -- 423},
publisher = {IEEE},
title = {{A quadratic time algorithm for the minmax length triangulation}},
doi = {10.1109/SFCS.1991.185400},
year = {1991},
}