A Quadratic Time Algorithm for the Minmax Length Triangulation

DOI10.1137/0222036zbMath0773.68067OpenAlexW2136630673MaRDI QIDQ4202210

Tiow Seng Tan, Herbert Edelsbrunner

Publication date: 1 September 1993

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0222036

zbMATH Keywords

triangulationtwo dimensionspoint setsminmax edge lengthnormed metrics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical interpolation (65D05)

Related Items

A linear time algorithm for max-min length triangulation of a convex polygon, Extensions of dynamic programming for multi-stage combinatorial optimization, 3D boundary recovery by constrained Delaunay tetrahedralization, Optimization for first order Delaunay triangulations, Optimal Higher Order Delaunay Triangulations of Polygons, Optimal higher order Delaunay triangulations of polygons, LMT-skeleton heuristics for several new classes of optimal triangulations, Approximating uniform triangular meshes in polygons.