## A Quadratic Time Algorithm for the MinMax Length Triangulation (1991)

Venue: | SIAM J. Comput |

Citations: | 27 - 3 self |

### BibTeX

@ARTICLE{Edelsbrunner91aquadratic,

author = {Herbert Edelsbrunner and Tiow and Seng Tan},

title = {A Quadratic Time Algorithm for the MinMax Length Triangulation},

journal = {SIAM J. Comput},

year = {1991},

volume = {22},

pages = {414--423}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. We show that a triangulation of a set of n points in the plane that minimizes the maximum edge length can be computed in time O(n 2). 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 modi cations the algorithm works for arbitrary normed metrics. Key words. Computational geometry,point sets, triangulations, two dimensions, minmax edge length, normed metrics AMS(MOS) subject classi cations. 68U05, 68Q25, 65D05 Appear in: SIAM Journal on Computing, 22 (3), 527{551, (1993)