The ArborX library: version 2.0
Andrey Prokopenko, Daniel Arndt, Damien Lebrun-Grandi\'e, Bruno Turcksin

TL;DR
The ArborX 2.0 library release introduces a flexible, performance portable geometric search library with new interfaces, data structures, user callback support, and expanded algorithms like ray tracing and clustering.
Contribution
This paper details the major updates in ArborX 2.0, including new interfaces, data structures, user function support, and additional algorithms, enhancing its versatility and performance.
Findings
Supports a wider range of user problems
Includes new search data structures like distributed search
Expands algorithms to include ray tracing and clustering
Abstract
This paper provides an overview of the 2.0 release of the ArborX library, a performance portable geometric search library based on Kokkos. We describe the major changes in ArborX 2.0 including a new interface for the library to support a wider range of user problems, new search data structures (brute force, distributed), support for user functions to be executed on the results (callbacks), and an expanded set of the supported algorithms (ray tracing, clustering).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics, Computing, and Information Processing
