Expand description
Visitors for performing geometric queries exploiting spatial partitioning data structures.
Structs§
- Spatial partitioning data structure visitor collecting interferences with a given bounding volume.
- Spatial partitioning data structure visitor collecting interferences with a given bounding volume.
- Spatial partitioning data structure visitor collecting interferences with a given bounding volume.
- Best-first traversal visitor for computing the point closest to a composite shape.
- Visitor for checking if a composite shape contains a specific point.
- Spatial partitioning structure visitor collecting nodes that may contain a given point.
- Bounding Volume Tree visitor collecting intersections with a given ray.