OpenVDB 7.0.0

Classes | Namespaces | Functions
FindActiveValues.h File Reference

Finds the active values in a tree which intersects a bounding box. Two methods are provided, one that counts the number of active values and one that simply tests if any active values intersect the bbox. More...

`#include <vector>`
`#include <openvdb/version.h>`
`#include <openvdb/Types.h>`
`#include <openvdb/tree/ValueAccessor.h>`
`#include <tbb/blocked_range.h>`
`#include <tbb/parallel_reduce.h>`

Go to the source code of this file.

## Classes
class | FindActiveValues< TreeT >
| Finds the active values in a tree which intersects a bounding box. More...
struct | FindActiveValues< TreeT >::NodePairT

## Namespaces
| openvdb
| openvdb::v7_0
| openvdb::v7_0::tools

## Functions
template<typename TreeT >
bool | anyActiveValues (const TreeT &tree, const CoordBBox &bbox)
| Returns true if the bounding box intersects any of the active values in a tree, i.e. either active voxels or active tiles. More...
template<typename TreeT >
bool | noActiveValues (const TreeT &tree, const CoordBBox &bbox)
| Returns true if the bounding box intersects none of the active values in a tree, i.e. neither active voxels or active tiles. More...
template<typename TreeT >
Index64 | countActiveValues (const TreeT &tree, const CoordBBox &bbox)
| Returns the number of active values that intersects a bounding box intersects, i.e. the count includes both active voxels and virtual voxels in active tiles. More...
template<typename TreeT >
bool | countActiveValues (const TreeT &tree, const CoordBBox &bbox)
| Returns the number of active values that intersects a bounding box intersects, i.e. the count includes both active voxels and virtual voxels in active tiles. More...

## Detailed Description

Finds the active values in a tree which intersects a bounding box. Two methods are provided, one that counts the number of active values and one that simply tests if any active values intersect the bbox.

Warning
  For repeated calls to the free-standing functions defined below consider instead creating an instance of FindActiveValues and then repeatedly call its member methods. This assumes the tree to be constant between calls but is sightly faster.

Author
  Ken Museth