Design and implementation of a practical parallel Delaunay algorithm

DOI10.1007/PL00008262MaRDI QIDQ1125808zbMATH OpenOpenAlexFDO

Authors J. C. Hardwick, D. Talmor, Guy E. Blelloch, Gary L. Miller

Publication date 17 July 2000

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00008262

zbMATH Keywords

parallel algorithmDelaunay triangulation

Mathematics Subject Classification ID

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

Cited in

(12)

• PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES
• One machine, one minute, three billion tetrahedra
• Parallel geometric algorithms for multi-core computers
• scientific article; zbMATH DE number 7499212 (Why is no real title available?)
• Parallel Delaunay triangulation in three dimensions
• COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS
• The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
• A sweep-line algorithm for spatial clustering
• Recent advances in parallel advancing front grid generation
• A parallel algorithm based on convexity for the computing of Delaunay tessellation
• \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations
• A new parallel algorithm for constructing Voronoi tessellations from distributed input data

This page was built for publication: Design and implementation of a practical parallel Delaunay algorithm

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