an AABB bounding volume tree that looks similar to a KdTree More...

#include <aabb_tree.h>

Inheritance diagram for lass::spat::AabbTree< ObjectType, ObjectTraits, SplitHeuristics >:

Public Member Functions
bool	contains (const TPoint &point, const TInfo *info=0) const
	Check whether there's any object in the tree that contains point.

template<typename OutputIterator>
OutputIterator	find (const TPoint &point, OutputIterator result, const TInfo *info=0) const
	Find all objects that contain point.

template<typename OutputIterator>
OutputIterator	find (const TAabb &box, OutputIterator result, const TInfo *info=0) const
	Find all objects that intersect (overlap) with box.

template<typename OutputIterator>
OutputIterator	find (const TRay &ray, TParam tMin, TParam tMax, OutputIterator result, const TInfo *info=0) const
	Find all objects that have an intersection with ray between tMin and tMax.

Detailed Description

template<typename ObjectType, typename ObjectTraits = DefaultObjectTraits<ObjectType>, typename SplitHeuristics = DefaultSplitHeuristics>
class lass::spat::AabbTree< ObjectType, ObjectTraits, SplitHeuristics >

an AABB bounding volume tree that looks similar to a KdTree

Author: Bram de Greve [BdG]

the AabbTree does NOT own the objects. You must keep them yourself!

Definition at line 77 of file aabb_tree.h.

The documentation for this class was generated from the following files:

Public Member Functions

Detailed Description