Home
The ArborX library allows users to search for nearby geometric objects in a performance portable way. By geometric search, we mean the task of finding the nearest neighbors of an object, or finding all objects within a certain distance. These tasks are often called k-nearest neighbor search (kNN) and radius-based search. ArborX is designed to run on a variety of hardware, from commodity CPUs to specialized accelerators (GPUs), all the while providing high performance. ArborX relies on Kokkos for a programming model abstraction.
This Wiki provides a number of resources for ArborX users and developers.
Here you can find instructions on building ArborX.
Here you can learn the syntax of functions and classes.
Here you can find the meaning of terms used in the API descriptions.