Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions

DOI10.1016/0167-8396(94)00018-NMaRDI QIDQ673501zbMATH OpenFDO

Authors Michael A. Facello

Publication date 28 February 1997

Published in Computer Aided Geometric Design (Search for Journal in Brave)

zbMATH Keywords

Grid generationGeometric algorithmsRegular and Delaunay triangulations

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• A Robust Implementation for Three-Dimensional Delaunay Triangulations
• Fast Delaunay triangulation in three dimensions
• An optimal algorithm for realizing a Delaunay triangulation
• scientific article; zbMATH DE number 177830
• Randomized incremental construction of Delaunay and Voronoi diagrams
• Fast and efficient restricted Delaunay triangulation in random geometric graphs
• Randomized incremental construction of Delaunay triangulations of nice point sets
• Randomized incremental construction of Delaunay triangulations of nice point sets

Cites work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 53893 (Why is no real title available?)
• scientific article; zbMATH DE number 177830 (Why is no real title available?)
• scientific article; zbMATH DE number 3633698 (Why is no real title available?)
• scientific article; zbMATH DE number 3016052 (Why is no real title available?)
• An apporach to automatic three-dimensional finite element mesh generation
• Construction of three-dimensional Delaunay triangulations using local transformations
• Geometry-based fully automatic mesh generation and the delaunay triangulation
• Incremental topological flipping works for regular triangulations
• Power Diagrams: Properties, Algorithms and Applications
• Primitives for the manipulation of three-dimensional subdivisions
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Three-Dimensional Triangulations from Local Transformations

Cited in

(12)

• A Robust Implementation for Three-Dimensional Delaunay Triangulations
• 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
• A fast algorithm for constructing Delaunay triangulations in the plane
• Mixed-volume computation by dynamic lifting applied to polynomial system solving
• Regular triangulations of dynamic sets of points
• Implementing Delaunay triangulations of the Bolza surface
• Triangulating point sets in space
• scientific article; zbMATH DE number 1728310 (Why is no real title available?)
• scientific article; zbMATH DE number 5019916 (Why is no real title available?)
• DEpthLAUNAY
• ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS
• Decoupling the \textsc{Cgal} 3D triangulations from the underlying space

This page was built for publication: Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions

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