Fast greedy triangulation algorithms.

DOI10.1016/S0925-7721(97)89149-3MaRDI QIDQ2482901zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Matthew T. Dickerson, Scott McElfresh, R. L. Drysdale, Emo Welzl

Publication date 25 April 2008

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0925-7721(97)89149-3

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Recommendations

• scientific article; zbMATH DE number 4064506
• A space efficient greedy triangulation algorithm
• The greedy triangulation can be computed from the Delaunay triangulation in linear time
• On approximation behavior of the greedy triangulation for convex polygons
• Computational Science and Its Applications – ICCSA 2004

Cites work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 1256675 (Why is no real title available?)
• A New Heuristic for Minimum Weight Triangulation
• A heuristic triangulation algorithm
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• A note on Delaunay and optimal triangulations
• A space efficient greedy triangulation algorithm
• ENUMERATING INTERDISTANCES IN SPACE
• Efficiently updating constrained Delaunay triangulations
• Fast algorithms for greedy triangulation
• Fixed-radius near neighbors search algorithms for points and segments
• Generalized Delaunay triangulation for planar graphs
• Minimal Triangulations of Polygonal Domains
• Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
• New results for the minimum weight triangulation problem
• On approximation behavior of the greedy triangulation for convex polygons
• On the average length of Delaunay triangulations
• On the identification of the convex hull of a finite set of points in the plane
• Piecewise-Linear Interpolation between Polygonal Slices
• SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
• The complexity of finding fixed-radius near neighbors
• The greedy and Delaunay triangulations are not bad in the average case
• The greedy triangulation can be computed from the Delaunay triangulation in linear time
• �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten

Cited in

(8)

• On exclusion regions for optimal triangulations
• The greedy triangulation can be computed from the Delaunay triangulation in linear time
• On a linear program for minimum-weight triangulation
• A space efficient greedy triangulation algorithm
• Triangulations intersect nicely
• scientific article; zbMATH DE number 1555973 (Why is no real title available?)
• Greedy triangulation can be efficiently implemented in the average case
• scientific article; zbMATH DE number 4064506 (Why is no real title available?)

This page was built for publication: Fast greedy triangulation algorithms.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482901)