Design and implementation of a practical parallel Delaunay algorithm
From MaRDI portal
Publication:1125808
DOI10.1007/PL00008262zbMath0941.68816OpenAlexW1987569615MaRDI QIDQ1125808
J. C. Hardwick, D. Talmor, Guy E. Blelloch, Gary Lee 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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items (10)
Recent advances in parallel advancing front grid generation ⋮ The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs ⋮ Unnamed Item ⋮ A parallel algorithm based on convexity for the computing of Delaunay tessellation ⋮ A new parallel algorithm for constructing Voronoi tessellations from distributed input data ⋮ Parallel Delaunay triangulation in three dimensions ⋮ COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS ⋮ Parallel geometric algorithms for multi-core computers ⋮ A sweep-line algorithm for spatial clustering ⋮ PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES
This page was built for publication: Design and implementation of a practical parallel Delaunay algorithm