Lines Matching full:over
32 * of the two basic algorithms over a BVH: intersection of a query object against all objects in the hierarchy and minimization
33 * of a function over the objects in the hierarchy. It also provides intersection and minimization over a cartesian product of
36 * over a volume is no greater than the minimum of a function over any object contained in it.
47 * Some sample queries that can be written in terms of function minimization over a set of objects are:
61 typedef VolumeIterator //an iterator type over node children--returns Index
62 typedef ObjectIterator //an iterator over object (leaf) children--returns const Object &
67 //getChildren takes a node index and makes [outVBegin, outVEnd) range over its node children
68 //and [outOBegin, outOEnd) range over its object children
