Fast greedy triangulation algorithms.

DOI10.1016/S0925-7721(97)89149-3zbMath1133.68461DBLPjournals/comgeo/DickersonDMW97OpenAlexW2219094305WikidataQ54309205 ScholiaQ54309205MaRDI QIDQ2482901

Scott A. McElfresh, Matthew T. Dickerson, Robert L. Scot Drysdale, Ermo 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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Efficiently updating constrained Delaunay triangulations
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Fixed-radius near neighbors search algorithms for points and segments
• On the average length of Delaunay triangulations
• The greedy and Delaunay triangulations are not bad in the average case
• Generalized Delaunay triangulation for planar graphs
• On approximation behavior of the greedy triangulation for convex polygons
• A space efficient greedy triangulation algorithm
• A note on Delaunay and optimal triangulations
• Fast algorithms for greedy triangulation
• The complexity of finding fixed-radius near neighbors
• Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
• New results for the minimum weight triangulation problem
• The greedy triangulation can be computed from the Delaunay triangulation in linear time
• On the identification of the convex hull of a finite set of points in the plane
• A heuristic triangulation algorithm
• A New Heuristic for Minimum Weight Triangulation
• Minimal Triangulations of Polygonal Domains
• ENUMERATING INTERDISTANCES IN SPACE
• SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
• Piecewise-Linear Interpolation between Polygonal Slices
• [https://portal.mardi4nfdi.de/wiki/Publication:5728818 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten]

Related Items (3)

On exclusion regions for optimal triangulations ⋮ Triangulations intersect nicely ⋮ Unnamed Item

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