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

DOI10.1016/0167-8396(94)00018-NzbMATH Open0875.68842MaRDI QIDQ673501FDOQ673501

Michael A. Facello

Publication date: 28 February 1997

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

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
• 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
• scientific article; zbMATH DE number 7525459
• Efficiently navigating a random Delaunay triangulation
• Efficiently navigating a random Delaunay triangulation

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Power Diagrams: Properties, Algorithms and Applications
• Title not available (Why is that?)
• An apporach to automatic three-dimensional finite element mesh generation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Incremental topological flipping works for regular triangulations
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Title not available (Why is that?)
• Construction of three-dimensional Delaunay triangulations using local transformations
• Primitives for the manipulation of three-dimensional subdivisions
• Geometry-based fully automatic mesh generation and the delaunay triangulation
• Three-Dimensional Triangulations from Local Transformations

Cited In (9)

• A fast algorithm for constructing Delaunay triangulations in the plane
• Regular triangulations of dynamic sets of points
• Mixed-volume computation by dynamic lifting applied to polynomial system solving
• Title not available (Why is that?)
• Title not available (Why is that?)
• Triangulating point sets in space
• ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS
• A Robust Implementation for Three-Dimensional Delaunay Triangulations
• 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)

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)