An optimal algorithm for realizing a Delaunay triangulation
From MaRDI portal
Publication:287080
DOI10.1016/S0020-0190(97)00071-9zbMATH Open1337.68275OpenAlexW2037540484MaRDI QIDQ287080FDOQ287080
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
Recommendations
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
- Title not available (Why is that?)
- Generation of convex polygons with individual angular constraints
- On the computer generation of random convex hulls
- Generating binary trees at random
- Simpler proof of a realizability theorem on Delaunay triangulations
- Random polytopes: Their definition, generation and aggregate properties
- Monte carlo estimates of the distributions of the random polygons determined by random lines in a plane
- Title not available (Why is that?)
- On the modality of convex polygons
- Realizability of 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
- Solutions to the Minimum Variance Problem Using Delaunay Triangulation
- Realizability of Delaunay triangulations
- Delaunay Triangular Meshes in Convex Polygons
- A generalized Delaunay triangulation algorithm with adaptive grid size control
- Simpler proof of a realizability theorem on Delaunay triangulations
- Optimization for first order Delaunay triangulations
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Delaunay-TIN building algorithm and optimization based on convex hull
- Witness (Delaunay) graphs
- A time-optimal delaunay refinement algorithm in two dimensions
- Star-unfolding polygons
- Exact computation of Delaunay and power triangulations
- IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION
- Outerplanar graphs and Delaunay triangulations
- Optimization for First Order Delaunay Triangulations
- Optimal higher order Delaunay triangulations of polygons
- A simple algorithm for higher-order Delaunay mosaics and alpha shapes
- Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions
- Computing optimal triangulations using simulated annealing
Uses Software
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)
