Parallel geometric algorithms for multi-core computers

DOI10.1016/j.comgeo.2010.04.008zbMath1344.68254MaRDI QIDQ991179

Vicente H. F. Batista, Johannes Singler, David L. Millman, Sylvain Pion

Publication date: 2 September 2010

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00488961/file/parallel_cgal.pdf

zbMATH Keywords

parallel algorithmsDelaunay triangulationsbox intersectioncompact containerspatial sort

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (3)

Thread-parallel mesh improvement using face and edge swapping and vertex insertion ⋮ Load-Balancing for Parallel Delaunay Triangulations ⋮ Parallel Delaunay triangulation in three dimensions

Uses Software

• CGAL
• DeWall
• MCSTL
• libstdc++
• 3D triangulations
• Spatial Sorting
• 2D triangulations
• Intel TBB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel computational geometry
• Design and implementation of a practical parallel Delaunay algorithm
• Triangulations in CGAL
• Applications of random sampling in computational geometry. II
• WALKING IN A TRIANGULATION
• Computing Dirichlet Tessellations in the Plane
• Parallel Delaunay mesh generation kernel
• FAST SOFTWARE FOR BOX INTERSECTIONS
• Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
• Transactions and privatization in Delaunay triangulation

This page was built for publication: Parallel geometric algorithms for multi-core computers