forked from arborx/ArborX
-
Notifications
You must be signed in to change notification settings - Fork 0
ArborX::BruteForce
Andrey Prokopenko edited this page Oct 28, 2024
·
5 revisions
Defined in header <ArborX_BruteForce.hpp>
template <typename MemorySpace>
class BruteForce;
The class template ArborX::BruteForce
is a data structure that can be used to search for geometrical objects in space. When performing queries, it checks all primitives against all predicates.
MemorySpace
: A valid Kokkos memory space.
Member type | Definition |
---|---|
memory_space |
MemorySpace |
size_type |
MemorySpace::size_type |
bounding_volume_type |
ArborX::Box |
(constructor) |
constructs the data structure |
size |
returns the number of elements stored in the data structure |
empty |
checks whether the data structure has no elements |
bounds |
returns an axis-aligned bounding box able to contain all elements stored in the data structure |
query |
finds all elements that satisfy given predicates, e.g. intersecting with a box or a sphere |