Fast greedy triangulation algorithms.

DOI10.1016/S0925-7721(97)89149-3zbMATH Open1133.68461DBLPjournals/comgeo/DickersonDMW97OpenAlexW2219094305WikidataQ54309205 ScholiaQ54309205MaRDI QIDQ2482901FDOQ2482901

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Title not available (Why is that?)
• On exclusion regions for optimal triangulations
• On a linear program for minimum-weight triangulation
• A space efficient greedy triangulation algorithm
• Title not available (Why is that?)
• The greedy triangulation can be computed from the Delaunay triangulation in linear time
• Triangulations intersect nicely
• Greedy triangulation can be efficiently implemented in the average case

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)