A Quadratic Time Algorithm for the Minimax Length Triangulation

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(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 modifications the algorithm works for arbitrary normed metrics.

[1]  R. Kent Goodrich,et al.  Lawson's triangulation is nearly optimal for controlling error bounds , 1990 .

[2]  David A. Plaisted,et al.  A Heuristic Triangulation Algorithm , 1987, J. Algorithms.

[3]  G. Klincsek.  Minimal Triangulations of Polygonal Domains , 1980 .

[4]  C. Lawson.  Software for C1 Surface Interpolation , 1977 .

[5]  Kenneth J. Supowit,et al.  The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees , 1983, JACM.

[6]  Peter Gilbert.  New Results on Planar Triangulations. , 1979 .

[7]  Tiow Seng Tan,et al.  An O(n2 log n) Time Algorithm for the Minmax Angle Triangulation , 1992, SIAM J. Sci. Comput..

[8]  V. T. Rajan.  Optimality of the Delaunay triangulation in ℝd , 1994, Discret. Comput. Geom..

[9]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[10]  B. Joe,et al.  Corrections to Lee's visibility polygon algorithm , 1987, BIT.

[11]  D. T. Lee,et al.  Visibility of a simple polygon , 1983, Comput. Vis. Graph. Image Process..

[12]  A. Lingas.  A new heuristic for minimum weight triangulation , 1987 .

[13]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[14]  Robin Sibson,et al.  Locally Equiangular Triangulations , 1978, Comput. J..

[15]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[16]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[17]  Errol L. Lloyd.  On triangulations of a set of points in the plane , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).