A Quadratic Time Algorithm for the Minmax Length Triangulation
From MaRDI portal
Publication:4202210
DOI10.1137/0222036zbMath0773.68067MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
65D05: Numerical interpolation
Related Items
Optimal Higher Order Delaunay Triangulations of Polygons, A linear time algorithm for max-min length triangulation of a convex polygon, Optimal higher order Delaunay triangulations of polygons, LMT-skeleton heuristics for several new classes of optimal triangulations, Approximating uniform triangular meshes in polygons., Extensions of dynamic programming for multi-stage combinatorial optimization, Optimization for first order Delaunay triangulations, 3D boundary recovery by constrained Delaunay tetrahedralization