An optimal algorithm for realizing a Delaunay triangulation

DOI10.1016/S0020-0190(97)00071-9MaRDI QIDQ287080zbMATH OpenOpenAlexFDO

Authors Timothy Lambert

Publication date 26 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(97)00071-9

zbMATH Keywords

computational geometryconvex polygonsDelaunay triangulationrealizability

Mathematics Subject Classification ID

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

Recommendations

• Realizability of Delaunay triangulations
• Simpler proof of a realizability theorem on Delaunay triangulations
• Generalized Delaunay triangulation for planar graphs
• A fast algorithm for constructing Delaunay triangulations in the plane
• Delaunay Triangular Meshes in Convex Polygons

Cites work

• scientific article; zbMATH DE number 176581 (Why is no real title available?)
• scientific article; zbMATH DE number 3106950 (Why is no real title available?)
• Generating binary trees at random
• Generation of convex polygons with individual angular constraints
• Monte carlo estimates of the distributions of the random polygons determined by random lines in a plane
• On the computer generation of random convex hulls
• On the modality of convex polygons
• Random polytopes: Their definition, generation and aggregate properties
• Realizability of Delaunay triangulations
• Simpler proof of a realizability theorem on Delaunay triangulations

Cited in

(24)

• Approximating constrained tetrahedrizations
• An algorithm for dynamic Delaunay triangulation of simple polygon
• The Voronoi functional is maximized by the Delaunay triangulation in the plane
• Formal study of plane Delaunay triangulation
• Realizability of Delaunay triangulations
• Solutions to the Minimum Variance Problem Using Delaunay Triangulation
• Delaunay Triangular Meshes in Convex Polygons
• Simpler proof of a realizability theorem on Delaunay triangulations
• A generalized Delaunay triangulation algorithm with adaptive grid size control
• Optimization for first order Delaunay triangulations
• scientific article; zbMATH DE number 177537 (Why is no real title available?)
• scientific article; zbMATH DE number 1786514 (Why is no real title available?)
• A Delaunay-TIN building algorithm and optimization based on convex hull
• Witness (Delaunay) graphs
• A time-optimal delaunay refinement algorithm in two dimensions
• Exact computation of Delaunay and power triangulations
• Star-unfolding polygons
• Outerplanar graphs and Delaunay triangulations
• IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION
• Optimal higher order Delaunay triangulations of polygons
• Optimization for First Order Delaunay Triangulations
• Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions
• Computing optimal triangulations using simulated annealing
• A simple algorithm for higher-order Delaunay mosaics and alpha shapes

Describes a project that uses

Uses Software

• GeoBench

This page was built for publication: An optimal algorithm for realizing a Delaunay triangulation

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