Pargeo: a library for parallel computational geometry

DOI10.4230/LIPICS.ESA.2022.88MaRDI QIDQ6969588zbMATH OpenFDO

Authors Yiqiu Wang, Rahul Yesantharao, Shangdi Yu, Laxman Dhulipala, Yan Gu, Julian Shun

Publication date 19 June 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2022.88

zbMATH Keywords

computational geometrylibrariesparallel algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Applications of random sampling in computational geometry. II
• ArborX
• Cache-oblivious data structures for orthogonal range searching
• Convex hulls of finite sets of points in two and three dimensions
• Decomposable searching problems
• Decomposable searching problems I. Static-to-dynamic transformation
• scientific article; zbMATH DE number 437554 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 6876091 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Multidimensional binary search trees used for associative searching
• Parallel computational geometry
• Parallel construction of subdivision hierarchies
• Parallel geometric algorithms for multi-core computers
• Parallel nearest neighbors in low dimensions with batch updates
• Parallelism in randomized incremental algorithms
• THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED
• The quickhull algorithm for convex hulls

This page was built for publication: Pargeo: a library for parallel computational geometry

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