Paper Info
Title
A quadratic time algorithm for the minmax length triangulation
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 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.
Year
DOI
Venue
1993
10.1137/0222036
SIAM J. Comput.
Keywords
DocType
Volume
computational geometry,two dimensions
Journal
22
Issue
ISSN
Citations 
3
0097-5397
22
PageRank 
References 
Authors
2.66
8
2
Name
Order
Citations
PageRank
Herbert Edelsbrunner167871112.29
Tiow-Seng Tan239827.99