The greedy triangulation can be computed from the Delaunay triangulation in linear time
From MaRDI portal
Publication:1969592
DOI10.1016/S0925-7721(99)00037-1zbMath0947.65015MaRDI QIDQ1969592
Drago Krznaric, Christos Levcopoulos
Publication date: 22 October 2000
Published in: Computational Geometry (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)
Related Items (8)
A fast heuristic for approximating the minimum weight triangulation ⋮ Good triangulations yield good tours ⋮ A new asymmetric inclusion region for minimum weight triangulation ⋮ Unnamed Item ⋮ Fast greedy triangulation algorithms. ⋮ Optimal Higher Order Delaunay Triangulations of Polygons ⋮ Triangulations intersect nicely ⋮ Optimal higher order Delaunay triangulations of polygons
This page was built for publication: The greedy triangulation can be computed from the Delaunay triangulation in linear time
