 ABTransform | This class implements the Transformer functor interface (specifically, the isAffine(), transform() and invTransform() methods) for a transform that maps an A grid into a B grid's index space such that, after resampling, A's index space and transform match B's index space and transform |
 AdaptiveMeshOp | |
 Archive | Grid serializer/unserializer |
  File | Grid archive associated with a file on disk |
  Stream | Grid archive associated with arbitrary input and output streams (not necessarily files) |
 AuxiliaryData< DistTreeT, AuxDataT > | |
 NodeMask< Log2Dim >::BaseIterator | |
  NodeMask< Log2Dim >::DenseIterator | |
  NodeMask< Log2Dim >::OffIterator | |
  NodeMask< Log2Dim >::OnIterator | |
 RootNodeMask::BaseIterator | |
  RootNodeMask::DenseIterator | |
  RootNodeMask::OffIterator | |
  RootNodeMask::OnIterator | |
 BaseStencil< _GridType, StencilType > | |
 BaseStencil< GridType, CurvatureStencil< GridType > > | |
  CurvatureStencil< GridType > | |
 BaseStencil< GridType, DenseStencil< GridType > > | |
  DenseStencil< GridType > | Dense stencil of a given width |
 BaseStencil< GridType, FourthOrderDenseStencil< GridType > > | |
  FourthOrderDenseStencil< GridType > | |
 BaseStencil< GridType, GradStencil< GridType > > | |
  GradStencil< GridType > | |
 BaseStencil< GridType, NineteenPointStencil< GridType > > | |
  NineteenPointStencil< GridType > | |
 BaseStencil< GridType, SecondOrderDenseStencil< GridType > > | |
  SecondOrderDenseStencil< GridType > | |
 BaseStencil< GridType, SevenPointStencil< GridType > > | |
  SevenPointStencil< GridType > | |
 BaseStencil< GridType, SixthOrderDenseStencil< GridType > > | |
  SixthOrderDenseStencil< GridType > | |
 BaseStencil< GridType, ThirteenPointStencil< GridType > > | |
  ThirteenPointStencil< GridType > | |
 BaseStencil< GridType, WenoStencil< GridType > > | |
  WenoStencil< GridType > | This is a special 19-point stencil that supports optimal fifth-order WENO upwinding, second-order central differencing, Laplacian, and zero-crossing test |
 BBox< _VectorType > | Axis-aligned bounding box |
 BBox< Vec3d > | |
 BIAS_SCHEME< bgs > | |
 BIAS_SCHEME< FIRST_BIAS > | |
 BIAS_SCHEME< HJWENO5_BIAS > | |
 BIAS_SCHEME< SECOND_BIAS > | |
 BIAS_SCHEME< THIRD_BIAS > | |
 BIAS_SCHEME< WENO5_BIAS > | |
 BoxSampler | |
 LeafNode< T, Log2Dim >::Buffer | |
 LeafNode< bool, Log2Dim >::Buffer | |
 LeafArray< TreeT, BufferCount >::BufferStruct | Simple structure of LeafNode pointers and corresponding write buffers |
 LeafArray< TreeT, 0 >::BufferStruct | Simple structure of LeafNode pointers and corresponding write buffers |
 CacheItem< TreeCacheT, NodeVecT, AtRoot > | |
 CacheItem< TreeCacheT, NodeVecT, true > | The tail of a compile-time list of cached node pointers, ordered from LeafNode to RootNode |
 CacheItem< ValueAccessor, SubtreeT, boost::mpl::size< SubtreeT >::value==1 > | |
 InternalNode< _ChildNodeType, Log2Dim >::ChildAll | |
 LeafNode< T, Log2Dim >::ChildAll | |
 InternalNode< _ChildNodeType, Log2Dim >::ChildOff | |
 LeafNode< T, Log2Dim >::ChildOff | |
 InternalNode< _ChildNodeType, Log2Dim >::ChildOn | |
 LeafNode< T, Log2Dim >::ChildOn | |
 ClosestPointProjector< CptGridT > | |
 CombineArgs< ValueType > | This struct collects both input and output arguments to "grid combiner" functors used with the tree::TypedGrid::combineExtended() and combine2Extended() methods. ValueType is the value type of the two grids being combined |
 CombineOpAdapter< ValueT, CombineOp > | Helper class to adapt a three-argument (a, b, result) CombineOp functor into a single-argument functor that accepts a CombineArgs struct |
 CompoundMap< T1, T2 > | Creates the composition of two maps, each of which could be a composition. In the case that each component of the composition classified as linear an acceleration AffineMap is stored |
 CompReplaceOp< TreeT > | |
 ConstrainedPointAdvect< GridT, PointListT, StaggeredVelocity, CptGridType, InterrupterType > | |
 ContourTracer< DistTreeT, InterruptT > | TBB Class object that slices up the volume into 2D slices that can be processed in parallel and marks the exterior contour of disjoint voxel sets in each slice |
 Coord | Signed (x, y, z) integer coordinates |
 CoordBBox | Axis-aligned bounding box of signed integer coordinates |
 CopyableOpApplier< IterT, OpT > | |
 CopyConstness< FromType, ToType > | |
 CopyConstness< const FromType, ToType > | |
 Count< DistTreeT > | |
 CPT< MapType, DiffScheme > | Compute the closest-point transform to a level set |
 Cpt< InGridType > | Computes the Closest-Point-Transform (CPT) from a distance field |
 CPT_RANGE< MapType, DiffScheme > | Compute the closest-point transform to a level set |
 CptFunctor< InGridT > | |
 CptImpl< InGridType, MapType, Scheme > | Computes the Closest-Point-Transform (CPT) from a distance field |
 CsgVisitorBase< TreeType > | |
  CsgDiffVisitor< TreeType > | |
  CsgIntersectVisitor< TreeType > | |
  CsgUnionVisitor< TreeType > | |
 Curl< MapType, DiffScheme > | Compute the curl of a vector-valued grid using differencing of various orders in the space defined by the range of the map |
 Curl< GridT > | Computes the Curl of a scalar grid |
 Curl< UniformScaleMap, CD_2ND > | |
 Curl< UniformScaleMap, DiffScheme > | |
 Curl< UniformScaleTranslateMap, CD_2ND > | |
 Curl< UniformScaleTranslateMap, DiffScheme > | |
 D1< DiffScheme > | |
 D1< BD_1ST > | |
 D1< BD_2ND > | |
 D1< BD_3RD > | |
 D1< BD_HJWENO5 > | |
 D1< BD_WENO5 > | |
 D1< CD_2ND > | |
 D1< CD_2NDT > | |
 D1< CD_4TH > | |
 D1< CD_6TH > | |
 D1< FD_1ST > | |
 D1< FD_2ND > | |
 D1< FD_3RD > | |
 D1< FD_HJWENO5 > | |
 D1< FD_WENO5 > | |
 D1Vec< DiffScheme > | |
 D1Vec< CD_2ND > | |
 D1Vec< CD_2NDT > | |
 D1Vec< CD_4TH > | |
 D1Vec< CD_6TH > | |
 D2< DiffScheme > | |
 D2< CD_FOURTH > | |
 D2< CD_SECOND > | |
 D2< CD_SIXTH > | |
 DimToWord< Log2Dim > | Mapping from a Log2Dim to a data type of size 2^Log2Dim bits |
 DimToWord< 3 > | |
 DimToWord< 4 > | |
 DimToWord< 5 > | |
 DimToWord< 6 > | |
 DiscreteField< VelGridT, Interpolator > | Sime wrapper class for a velocity grid |
 Divergence< MapType, DiffScheme > | Compute the Divergence of a vector-type grid using differnce of various orders, the reulst defined with respect to the range-space of the map |
 Divergence< InGridT > | Computes the Divergence of a scalar grid |
 Divergence< ScaleMap, CD_2ND > | |
 Divergence< ScaleMap, DiffScheme > | |
 Divergence< ScaleTranslateMap, CD_2ND > | |
 Divergence< ScaleTranslateMap, DiffScheme > | |
 Divergence< TranslationMap, DiffScheme > | |
 Divergence< UniformScaleMap, CD_2ND > | |
 Divergence< UniformScaleMap, DiffScheme > | |
 Divergence< UniformScaleTranslateMap, CD_2ND > | |
 Divergence< UniformScaleTranslateMap, DiffScheme > | |
 Dual< RealT > | |
 DualTrait< T > | |
 DualTrait< Dual< T > > | |
 EnrightField< ScalarT > | Analytical, divergence-free and periodic vecloity field |
 exception | |
  Exception | |
   ArithmeticError | |
   IllegalValueException | |
   IndexError | |
   IoError | |
   KeyError | |
   LookupError | |
   NotImplementedError | |
   ReferenceError | |
   RuntimeError | |
   TypeError | |
   ValueError | |
 ExpandNB< DistTreeT > | TBB Class object to expand the level-set narrow-band |
 Filter< GridT, InterruptT > | Filtering of VDB volumes |
 FogVolumeOp< ValueType > | |
 FormattedInt< IntT > | I/O manipulator that formats integer values with thousands separators |
 Frustum< Real > | Frustum GeClass |
 Curl< GridT >::Functor | |
 Divergence< InGridT >::Functor< DiffScheme > | |
 Gradient< InGridT >::Functor | |
 Laplacian< GridT >::Functor | |
 MeanCurvature< GridT >::Functor | |
 Magnitude< InGridT >::Functor | |
 Normalize< GridT >::Functor | |
 GenericMap | A wrapper that holds a MapBase::ConstPtr and exposes a reduced set of fucntionality needed by the mathematical operators. This may be used in some Map-templated code, when the over-head of actually resovling the Map type is large compared to the map work to be done |
 Gradient< MapType, DiffScheme > | Center difference gradient opperators, defined with respect to the range-space of the map |
 Gradient< InGridT > | Computes the Gradient of a scalar grid |
 Gradient< ScaleMap, CD_2ND > | |
 Gradient< ScaleTranslateMap, CD_2ND > | |
 Gradient< TranslationMap, DiffScheme > | |
 Gradient< UniformScaleMap, CD_2ND > | |
 Gradient< UniformScaleTranslateMap, CD_2ND > | |
 GradientBiased< MapType, GradScheme > | Biased gradient opperators, defined with respect to the range-space of the map note this will need to be divided by two in the case of CD_2NDT |
 GradientNormSqrd< MapType, GradScheme > | |
 GradientNormSqrd< UniformScaleMap, GradScheme > | |
 GradientNormSqrd< UniformScaleTranslateMap, GradScheme > | |
 GridDescriptor | |
 GridNamePred | Predicate functor that returns true for grids that have a specified name |
 GridResampler | |
  GridTransformer | A GridTransformer applies a geometric transformation to an input grid using one of several sampling schemes, and stores the result in an output grid |
 GridSampler< TreeOrAccessorType, SamplerType > | Base class that provides the interface for continuous sampling of values in a grid |
 GridSampling< TreeType > | Base class that provides the interface for continuous sampling of values in a grid |
  LinearInterp< TreeType > | Perform linear interpolation on a grid voxel to sample space |
  QuadraticInterp< TreeType > | |
 HalfReader< IsReal, T > | |
 HalfReader< false, T > | Partial specialization for non-floating-point types (no half to float promotion) |
 HalfReader< true, T > | Partial specialization for floating-point types |
 HalfWriter< IsReal, T > | |
 HalfWriter< false, T > | Partial specialization for non-floating-point types (no float to half quantization) |
 HalfWriter< true, T > | Partial specialization for floating-point types |
 Hermite | Quantized Hermite data object that stores compressed intersection information (offsets and normlas) for the up-wind edges of a voxel. (Size 10 bytes) |
 RayInterval< Real, ValueType >::Hit | Dummy class to distinguish constructors |
 InactivePrune< ValueType > | Helper class for the tree nodes to replace inactive tree branches with a more memory efficient inactive tiles with the provided value. Specialized but faster then the tolerance based pruning defined above |
 InteriorMaskOp< TreeType > | |
 InternalNode< _ChildNodeType, Log2Dim > | |
 IntersectingVoxelCleaner< DistTreeT > | TBB Class object that removes intersecting voxels that where set by rasterizing self-intersecting parts of the mesh |
 IntersectingVoxelSign< DistTreeT > | TBB Class object that traversers all the intersecting voxels (defined by the intersectingVoxelsGrid) and potentially flips their sign, by comparing the 'closest point' directions of outside-marked and non-intersecting neighbouring voxel |
 InvertedTree< HeadT, HeadLevel > | |
 InvertedTree< HeadT, HeadLevel > | |
 InvertedTree< HeadT, 1 > | |
 InvertedTree< HeadT, 1 > | |
 is_diagonal_jacobian< T > | |
 is_double< T > | |
 is_double< double > | |
 is_linear< T > | Map traits |
 is_linear< AffineMap > | |
 is_linear< CompoundMap< T1, T2 > > | |
 is_linear< ScaleMap > | |
 is_linear< ScaleTranslateMap > | |
 is_linear< TranslationMap > | |
 is_linear< UniformScaleMap > | |
 is_linear< UniformScaleTranslateMap > | |
 is_linear< UnitaryMap > | |
 is_scale< T > | |
 is_scale< ScaleMap > | |
 is_scale_translate< T > | |
 is_scale_translate< ScaleTranslateMap > | |
 is_uniform_diagonal_jacobian< T > | |
 is_uniform_scale< T > | |
 is_uniform_scale< UniformScaleMap > | |
 is_uniform_scale_translate< T > | |
 is_uniform_scale_translate< TranslationMap > | |
 is_uniform_scale_translate< UniformScaleTranslateMap > | |
 is_vec3d< Vec3T > | Simple tool to help determine when type conversions are needed |
 is_vec3d< Vec3d > | |
 ISCurl< DiffScheme > | Curl operator defined in index space using various first derivative schemes |
 ISDivergence< DiffScheme > | Divergence operator defined in index space using various first derivative schemes |
 ISGradient< DiffScheme > | Gradient operators defined in index space of various orders |
 ISGradientBiased< GradScheme, Vec3Bias > | Biased Gradient Operators, using upwinding defined by the Vec3Bias input |
 ISGradientNormSqrd< GradScheme > | |
 ISLaplacian< DiffScheme > | Laplacian defined in index space, using various ceneter-differnce stencils |
 ISLaplacian< CD_FOURTH > | |
 ISLaplacian< CD_SECOND > | |
 ISLaplacian< CD_SIXTH > | |
 ISMeanCurvature< DiffScheme2, DiffScheme1 > | Compute the mean curvature in index space |
 BIAS_SCHEME< FIRST_BIAS >::ISStencil< GridType > | |
 BIAS_SCHEME< SECOND_BIAS >::ISStencil< GridType > | |
 BIAS_SCHEME< THIRD_BIAS >::ISStencil< GridType > | |
 BIAS_SCHEME< WENO5_BIAS >::ISStencil< GridType > | |
 BIAS_SCHEME< HJWENO5_BIAS >::ISStencil< GridType > | |
 BIAS_SCHEME< bgs >::ISStencil< GridType > | |
 IteratorBase< MaskIterT, NodeT > | Base class for iterators over internal and leaf nodes |
  DenseIteratorBase< MaskIterT, IterT, NodeT, SetItemT, UnsetItemT > | Base class for dense iterators over internal and leaf nodes |
  SparseIteratorBase< MaskIterT, IterT, NodeT, ItemT > | Base class for sparse iterators over internal and leaf nodes |
  SparseIteratorBase< MaskIterT, ChildIter< MaskIterT, NodeT >, NodeT, bool > | |
   LeafNode< bool, Log2Dim >::ChildIter< MaskIterT, NodeT > | Leaf nodes have no children, so their child iterators have no get/set accessors |
  SparseIteratorBase< MaskIterT, ChildIter< MaskIterT, NodeT, TagT >, NodeT, ValueType > | |
   LeafNode< T, Log2Dim >::ChildIter< MaskIterT, NodeT, TagT > | Leaf nodes have no children, so their child iterators have no get/set accessors |
  SparseIteratorBase< MaskIterT, ChildIter< NodeT, ChildT, MaskIterT, TagT >, NodeT, ChildT > | |
   InternalNode< _ChildNodeType, Log2Dim >::ChildIter< NodeT, ChildT, MaskIterT, TagT > | |
  SparseIteratorBase< MaskIterT, ValueIter< MaskIterT, NodeT, ValueT >, NodeT, ValueT > | |
   LeafNode< bool, Log2Dim >::ValueIter< MaskIterT, NodeT, ValueT > | |
  SparseIteratorBase< MaskIterT, ValueIter< MaskIterT, NodeT, ValueT, TagT >, NodeT, ValueT > | |
   LeafNode< T, Log2Dim >::ValueIter< MaskIterT, NodeT, ValueT, TagT > | |
  SparseIteratorBase< MaskIterT, ValueIter< NodeT, ValueT, MaskIterT, TagT >, NodeT, ValueT > | |
   InternalNode< _ChildNodeType, Log2Dim >::ValueIter< NodeT, ValueT, MaskIterT, TagT > | |
 IteratorBase< MaskDenseIter, NodeT > | |
  DenseIteratorBase< MaskDenseIter, DenseIter< NodeT, ValueT >, NodeT, void, ValueT > | |
   LeafNode< bool, Log2Dim >::DenseIter< NodeT, ValueT > | |
 IteratorBase< MaskDenseIterator, NodeT > | |
  DenseIteratorBase< MaskDenseIterator, DenseIter< NodeT, ChildT, ValueT, TagT >, NodeT, ChildT, ValueT > | |
   InternalNode< _ChildNodeType, Log2Dim >::DenseIter< NodeT, ChildT, ValueT, TagT > | |
  DenseIteratorBase< MaskDenseIterator, DenseIter< NodeT, ValueT, TagT >, NodeT, void, ValueT > | |
   LeafNode< T, Log2Dim >::DenseIter< NodeT, ValueT, TagT > | |
 IteratorRange< IterT > | |
 IterListItem< PrevItemT, NodeVecT, VecSize, _Level > | An IterListItem is an element of a compile-time linked list of iterators to nodes of different types |
 IterListItem< IterListItem, RestT, VecSize-1, 1 > | |
 IterListItem< PrevChildItem, InvTreeT, ROOT_LEVEL+1, 0 > | |
 IterListItem< PrevItem, InvTreeT, ROOT_LEVEL+1, LEAF_LEVEL > | |
 IterListItem< PrevItemT, NodeVecT, 1, _Level > | The final element of a compile-time linked list of iterators to nodes of different types |
 IterListItem< PrevItemT, NodeVecT, VecSize, 0U > | The initial element of a compile-time linked list of iterators to nodes of different types |
 IterListItem< PrevValueItem, InvTreeT, ROOT_LEVEL+1, 0 > | |
 IterTraits< NodeT, IterT > | |
 IterTraits< NodeT, typename NodeT::ChildAllCIter > | |
 IterTraits< NodeT, typename NodeT::ChildAllIter > | |
 IterTraits< NodeT, typename NodeT::ChildOffCIter > | |
 IterTraits< NodeT, typename NodeT::ChildOffIter > | |
 IterTraits< NodeT, typename NodeT::ChildOnCIter > | |
 IterTraits< NodeT, typename NodeT::ChildOnIter > | |
 IterTraits< NodeT, typename NodeT::ValueAllCIter > | |
 IterTraits< NodeT, typename NodeT::ValueAllIter > | |
 IterTraits< NodeT, typename NodeT::ValueOffCIter > | |
 IterTraits< NodeT, typename NodeT::ValueOffIter > | |
 IterTraits< NodeT, typename NodeT::ValueOnCIter > | |
 IterTraits< NodeT, typename NodeT::ValueOnIter > | |
 IterTraits< typename PrevIterT::NonConstNodeType, PrevIterT > | |
 Laplacian< MapType, DiffScheme > | Compute the Laplacian at a given location in a grid using finite differencing of various orders. The result is defined in the range of the map |
 Laplacian< GridT > | Computes the Laplacian of a scalar grid |
 Laplacian< ScaleMap, DiffScheme > | |
 Laplacian< ScaleTranslateMap, DiffScheme > | |
 Laplacian< TranslationMap, DiffScheme > | |
 Laplacian< UniformScaleMap, DiffScheme > | |
 Laplacian< UniformScaleTranslateMap, DiffScheme > | |
 Laplacian< UnitaryMap, DiffScheme > | |
 LeafArray< TreeT, BufferCount > | This is a range and iterator class useful for multithreading computations on leaf values that require the use of multiple temporal buffers but static tree topology (i.e. only voxel values are dynamic). The internal buffer in LeafNodes is referred to as the read buffer, and the external buffers allocated by the LeafArray class are called write buffers. LeafArray::swapBuffers implements a multi-threaded method to efficiently swap the read buffer with any of the write buffers. See tools/Filter.h for an application |
 LeafArray< TreeT, 0 > | This template specialization of LeafArray contains no write buffers! Hence this is effectively a thin wrapper for std::vector<LeafNode*> |
 LeafCPtrList< TreeT > | |
 LeafCPtrList< CharTreeT > | |
 LeafCPtrList< DistTreeT > | |
 LeafIteratorBase< TreeT, RootChildOnIterT > | Base class for tree-traversal iterators over all leaf nodes (but not leaf voxels) |
 LeafManager< TreeT > | Given a tree this class defines a linear array of its leafs and optional auxiliary buffers. This is useful for multi-threading computations over leaf values in a static tree, i.e. voxel values, vs topology, is dynamic. The auxiliary buffers can conventiently be used for temporal integration. Efficient methods are provided for multi-threaded swapping and sync'ing (i.e. copying) of these buffers |
 LeafNode< T, Log2Dim > | Templated block class to hold specific data types and a fixed number of values determined by Log2Dim |
 LeafNode< bool, Log2Dim > | LeafNode specialization for values of type bool that stores both the active states and the values of (2^Log2Dim)^3 voxels as bit masks |
 LeafPtrList< TreeT > | |
 LeafPtrList< BoolTreeT > | |
 LeafPtrList< DistTreeT > | |
 LeafPtrList< IntTreeT > | |
 LeafTopologyDiffOp< TreeType1, TreeType2 > | Functor for use with tools::foreach() to compute the boolean difference between the value masks of corresponding leaf nodes in two trees |
 LeafTopologyIntOp< TreeType1, TreeType2 > | Functor for use with tools::foreach() to compute the boolean intersection between the value masks of corresponding leaf nodes in two trees |
 LeafTransformer< TreeType, LeafOp > | Threaded leaf-node transformation scheme |
 LegacyFrustum | LegacyFrustum GeClass used at DreamWorks for converting old vdb files |
 LevelSetAdvection< GridT, FieldT, InterruptT > | Hyperbolic advection of narrow-band level sets in an external velocity field |
 LevelSetFracture< GridType, InterruptType > | Level set fracturing |
 LevelSetPrune< ValueType > | Prune any descendants whose values are all inactive and replace them with inactive tiles having a values equal to the first value encountered in the (inactive) child |
 LevelSetSphere< GridT, InterruptT > | Generates a signed distance field (or narrow band level set) to a single sphere |
 LevelSetTracker< GridT, InterruptT > | Performs multi-threaded interface tracking of narrow band level sets |
  LevelSetFilter< GridT, InterruptT > | Filtering (i.e. diffusion) of narrow-band level sets |
 Magnitude< InGridT > | |
 MapBase | Abstract base class for maps |
  AffineMap | A general linear transform using homogeneous coordinates to perform rotation, scaling, shear and translation |
  NonlinearFrustumMap | This map is composed of three steps. Frist it will take a box of size (Lx X Ly X Lz) defined by an member data bounding box and map it into a frustum with near plane (1 X Ly/Lx) and precribed depth Then this frustum is transformed by an internal second map: most often a uniform scale, but other affects can be achieved by accumulating translation, shear and rotation: these are all applied to the second map |
  ScaleMap | A specialized Affine transform that scales along the principal axis the scaling need not be uniform in the three-directions |
   UniformScaleMap | A specialized Affine transform that scales along the principal axis the scaling is uniform in the three-directions |
  ScaleTranslateMap | A specialized Affine transform that scales along the principal axis the scaling need not be uniform in the three-directions, and then translates the result |
   UniformScaleTranslateMap | A specialized Affine transform that uniformaly scales along the principal axis and then translates the result |
  TranslationMap | A specialized linear transform that performs a translation |
  UnitaryMap | A specialized linear transform that performs a unitary maping i.e. rotation and or reflection |
 MapRegistry | Threadsafe singleton object for accessing the map type-name dictionary. Associates a map type-name with a factory function |
 Mat< SIZE, T > | |
  Mat3< double > | |
 Mat2< T > | |
 Mat< 3, T > | |
  Mat3< T > | 3x3 matrix class |
 Mat< 4, double > | |
  Mat4< double > | |
 Mat< 4, Real > | |
  Mat4< Real > | |
 Mat< 4, T > | |
  Mat4< T > | 4x4 -matrix class |
 GridTransformer::MatrixTransform | |
 MeanCurvature< MapType, DiffScheme2, DiffScheme1 > | Compute the Mean Curvature |
 MeanCurvature< GridT > | |
 MeanCurvature< TranslationMap, DiffScheme2, DiffScheme1 > | |
 MeanCurvature< UniformScaleMap, DiffScheme2, DiffScheme1 > | |
 MeanCurvature< UniformScaleTranslateMap, DiffScheme2, DiffScheme1 > | |
 Merge< DistTreeT > | |
 MergeBufferOp< TreeType, ValueType > | |
 MeshGen< DistTreeT, MeshingOp > | |
 MeshToVolume< DistGridT, InterruptT > | |
 MeshVoxelizer< DistTreeT, InterruptT > | TBB class object to voxelize a mesh of triangles and/or quads into a collection of VDB grids, namely a square distance grid, closest primitive grid and a intersecting voxels grid (the voxels intersect the mesh) |
 Metadata | Base class for storing metadata information in a grid |
  TypedMetadata< T > | Templated metadata class to hold specific types |
  UnknownMetadata | Subclass to read (and ignore) data of an unregistered type |
 MetaMap | Provides functionality storing type agnostic metadata information. Grids and other structures can inherit from this to attain metadata functionality |
  GridBase | Abstract base class for typed grids |
   Grid< DualTreeT > | |
   Grid< typename > | Container class that associates a tree with a transform and metadata |
 MinMaxVoxel< TreeType > | Threaded operation to find the min and max active voxel values |
 MinOp< TreeType, ValueType > | |
 File::NameIterator | |
 IterTraits< NodeT, typename NodeT::ChildOffIter >::NodeConverter< OtherNodeT > | |
 IterTraits< NodeT, typename NodeT::ChildOnIter >::NodeConverter< OtherNodeT > | |
 IterTraits< NodeT, typename NodeT::ChildOnCIter >::NodeConverter< OtherNodeT > | |
 IterTraits< NodeT, typename NodeT::ChildOffCIter >::NodeConverter< OtherNodeT > | |
 IterTraits< NodeT, typename NodeT::ChildAllIter >::NodeConverter< OtherNodeT > | |
 IterTraits< NodeT, typename NodeT::ValueOnIter >::NodeConverter< OtherNodeT > | |
 IterTraits< NodeT, typename NodeT::ValueOffIter >::NodeConverter< OtherNodeT > | |
 IterTraits< NodeT, typename NodeT::ValueOffCIter >::NodeConverter< OtherNodeT > | |
 IterTraits< NodeT, typename NodeT::ValueAllCIter >::NodeConverter< OtherNodeT > | |
 IterTraits< NodeT, typename NodeT::ValueAllIter >::NodeConverter< OtherNodeT > | |
 IterTraits< NodeT, typename NodeT::ValueOnCIter >::NodeConverter< OtherNodeT > | |
 IterTraits< NodeT, typename NodeT::ChildAllCIter >::NodeConverter< OtherNodeT > | |
 NodeIteratorBase< _TreeT, RootChildOnIterT > | Base class for tree-traversal iterators over all nodes |
 NodeMask< Log2Dim > | |
 NodeUnionImpl< ValueIsClass, ValueT, ChildT > | |
 NodeUnionImpl< boost::is_class< ValueT >::value, ValueT, ChildT > | |
  NodeUnion< ValueT, ChildT > | |
 NodeUnionImpl< boost::is_class< ValueType >::value, ValueType, ChildNodeType > | |
  NodeUnion< ValueType, ChildNodeType > | |
 NodeUnionImpl< false, ValueT, ChildT > | |
 NodeUnionImpl< true, ValueT, ChildT > | |
 NonUniformPointScatter< PointAccessorType, RandomGenerator, InterruptType > | Non-uniform scatters of point in the active voxels. The local point count is implicitly defined as a product of of a global density and the local voxel (or tile) value |
 Plane< Real >::Normalize | |
 Normalize< GridT > | |
 LevelSetTracker< GridT, InterruptT >::Normalizer< SpatialScheme, TemporalScheme > | |
 NullInterrupter | Dummy NOOP interrupter class defining interface |
 OffsetOp< ValueType > | |
 Magnitude< InGridT >::OpT | |
 Normalize< GridT >::OpT | |
 ParticlesToLevelSet< GridT, ParticleListT, InterruptT, RealT > | |
 ParticlesToLevelSetAndId< LevelSetGridT, ParticleListT, InterruptT > | Use this wrapper class to convert particles into a level set and a separate index grid of closest-point particle id. The latter can be used to subsequently transfer particles attributes into separate grids |
 Plane< Real > | Plane Class |
 PointAdvect< GridT, PointListT, StaggeredVelocity, InterrupterType > | |
 PointGen< DistTreeT > | |
 PointSampler | |
  TileSampler< PointSampler, TreeT > | For point sampling, tree traversal is less expensive than testing bounding box membership |
 PointTransform | |
 PolygonPool | Collection of quads and triangles |
 PrimCpy | |
 promote< S, T > | |
 QuadMeshOp | |
 QuadraticSampler | |
 QuantizedUnitVec | |
 Quat< T > | |
 RandomInt | Simple class to generate random intergers |
 Ray< _Real > | |
 RayInterval< Real, ValueType > | |
 RealToHalf< T > | RealToHalf and its specializations define a mapping from floating-point data types to analogous half float types |
 RealToHalf< double > | |
 RealToHalf< float > | |
 RealToHalf< Vec2d > | |
 RealToHalf< Vec2s > | |
 RealToHalf< Vec3d > | |
 RealToHalf< Vec3s > | |
 ReferenceData< DistTreeT > | |
 RenormOp< GridType, ValueType > | |
 ReturnValue< T > | |
 RootNode< ChildType > | |
 RootNodeMask | |
 Sampler | |
  TileSampler< Sampler, TreeT > | A TileSampler wraps a grid sampler of another type (BoxSampler, QuadraticSampler, etc.), and for samples that fall within a given tile of the grid, it returns a cached tile value instead of accessing the grid |
 ScalarToVectorConverter< ScalarGridType > | ScalarToVectorConverter<ScalarGridType>::Type is the type of a grid having the same tree configuration as ScalarGridType but value type Vec3<T> where T is ScalarGridType::ValueType |
 SeamMaskGen< DistTreeT > | |
 set | |
  RayIntervalSet< Real, ValueType > | |
 ShallowCopy | |
 SharedOpApplier< IterT, OpT > | |
 SharedOpTransformer< InIterT, OutTreeT, OpT > | |
 ShellVoxelCleaner< DistTreeT > | TBB Class object that removes non-intersecting voxels that where set by rasterizing self-intersecting parts of the mesh |
 SqrtAndScaleOp< ValueType > | |
 StaggeredBoxSampler | |
 StaggeredPointSampler | |
  TileSampler< StaggeredPointSampler, TreeT > | For point sampling, tree traversal is less expensive than testing bounding box membership |
 StaggeredQuadraticSampler | |
 SwappedCombineOp< ValueType, CombineOp > | |
 TestLeafIO< typename > | |
 tolerance< T > | |
 tolerance< double > | |
 tolerance< float > | |
 TolerancePrune< ValueType > | Helper class for the tree nodes to replace constant tree branches (to within the provided tolerance) with a more memory efficient tile |
 TopologyCopy | |
 Transform | Calculate an axis-aligned bounding box in index space from a bounding sphere in world space |
 Tree4< T, N1, N2, N3 > | |
 TreeAdapter< _TreeType > | This adapter allows code that is templated on a Tree type to accept either a Tree type or a Grid type |
 TreeAdapter< Grid< _TreeType > > | Partial specialization for Grid types |
 TreeBase | Base class for typed trees |
  Tree< _RootNodeType > | |
 TreeIterTraits< TreeT, IterT > | TreeIterTraits provides, for all tree iterators, a begin(tree) function that returns an iterator over a tree of arbitrary type |
 TreeIterTraits< TreeT, typename TreeT::LeafCIter > | |
 TreeIterTraits< TreeT, typename TreeT::LeafIter > | |
 TreeIterTraits< TreeT, typename TreeT::NodeCIter > | |
 TreeIterTraits< TreeT, typename TreeT::NodeIter > | |
 TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildAllCIter > | |
 TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildAllIter > | |
 TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildOffCIter > | |
 TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildOffIter > | |
 TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildOnCIter > | |
 TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildOnIter > | |
 TreeIterTraits< TreeT, typename TreeT::ValueAllCIter > | |
 TreeIterTraits< TreeT, typename TreeT::ValueAllIter > | |
 TreeIterTraits< TreeT, typename TreeT::ValueOffCIter > | |
 TreeIterTraits< TreeT, typename TreeT::ValueOffIter > | |
 TreeIterTraits< TreeT, typename TreeT::ValueOnCIter > | |
 TreeIterTraits< TreeT, typename TreeT::ValueOnIter > | |
 TreeValueIteratorBase< _TreeT, ValueIterT > | Base class for tree-traversal iterators over tile and voxel values |
 TrimOp< ValueType > | |
 Tuple< SIZE, T > | |
 Tuple< 2, T > | |
  Vec2< T > | |
 Tuple< 3, double > | |
  Vec3< double > | |
 Tuple< 3, Int32 > | |
  Vec3< Int32 > | |
 Tuple< 3, Real > | |
  Vec3< Real > | |
 Tuple< 3, T > | |
  Vec3< T > | |
 Tuple< 4, T > | |
  Vec4< T > | |
 TupleAbs< SIZE, T, IsInteger > | Helper class to compute the absolute value of a Tuple |
 TupleAbs< SIZE, T, true > | |
 UniformPointScatter< PointAccessorType, RandomGenerator, InterruptType > | The two point scatters UniformPointScatter and NonUniformPointScatter depend on the following two classes: |
 ValueAccessorBase< TreeType > | This base class for ValueAccessors manages registration of an accessor with a tree so that the tree can automatically clear the accessor whenever one of its nodes is deleted |
  ValueAccessor< TreeType, TreeType::DEPTH-1, tbb::spin_mutex > | |
   ValueAccessorRW< TreeType > | |
 ValueAccessorBase< _TreeType > | |
  ValueAccessor< _TreeType, CacheLevels, MutexType > | |
  ValueAccessor0< TreeType > | ValueAccessor with no mutex and no node caching |
   ValueAccessor< TreeType, 0, tbb::null_mutex > | |
  ValueAccessor1< TreeType, L0 > | Value accessor with one level of node caching |
  ValueAccessor2< TreeType, L0, L1 > | Value accessor with two levels of node caching |
  ValueAccessor3< TreeType, L0, L1, L2 > | Value accessor with three levels of node caching |
  ValueAccessor1< TreeType > | |
   ValueAccessor< TreeType, 1, tbb::null_mutex > | Template specialization of the ValueAccessor with no mutex and 1 cache level |
  ValueAccessor2< TreeType > | |
   ValueAccessor< TreeType, 2, tbb::null_mutex > | Template specialization of the ValueAccessor with no mutex and 2 cache levels |
  ValueAccessor3< TreeType > | |
   ValueAccessor< TreeType, 3, tbb::null_mutex > | Template specialization of the ValueAccessor with no mutex and 3 cache levels |
 ValueAccessorBase< const BoolTreeT > | |
  ValueAccessor< const BoolTreeT > | |
 ValueAccessorBase< const IntTreeT > | |
  ValueAccessor< const IntTreeT > | |
 ValueAccessorBase< const StencilTreeT > | |
  ValueAccessor< const StencilTreeT > | |
 ValueAccessorBase< const TreeT > | |
  ValueAccessor< const TreeT > | |
 ValueAccessorBase< DistTreeT > | |
  ValueAccessor< DistTreeT > | |
 ValueAccessorBase< IndexTreeT > | |
  ValueAccessor< IndexTreeT > | |
 ValueAccessorBase< StencilTreeT > | |
  ValueAccessor< StencilTreeT > | |
 ValueAccessorBase< TreeT > | |
  ValueAccessor< TreeT > | |
 InternalNode< _ChildNodeType, Log2Dim >::ValueAll | |
 LeafNode< T, Log2Dim >::ValueAll | |
 RootNode< ChildType >::ValueConverter< OtherValueType > | ValueConverter<T>::Type is the type of a RootNode having the same child hierarchy as this node but a different value type, T |
 Tree< _RootNodeType >::ValueConverter< OtherValueType > | ValueConverter<T>::Type is the type of a tree having the same hierarchy as this tree but a different value type, T |
 InternalNode< _ChildNodeType, Log2Dim >::ValueConverter< OtherValueType > | ValueConverter<T>::Type is the type of an InternalNode having the same child hierarchy and dimensions as this node but a different value type, T |
 Grid< typename >::ValueConverter< OtherValueType > | ValueConverter<T>::Type is the type of a grid having the same hierarchy as this grid but a different value type, T |
 LeafNode< bool, Log2Dim >::ValueConverter< ValueType > | ValueConverter<T>::Type is the type of a LeafNode having the same dimensions as this node but a different value type, T |
 LeafNode< T, Log2Dim >::ValueConverter< OtherValueType > | ValueConverter<T>::Type is the type of a LeafNode having the same child hierarchy and dimensions as this node but a different value type, T |
 LeafNode< T, Log2Dim >::ValueOff | |
 InternalNode< _ChildNodeType, Log2Dim >::ValueOff | |
 LeafNode< T, Log2Dim >::ValueOn | |
 InternalNode< _ChildNodeType, Log2Dim >::ValueOn | |
 VectorToScalarConverter< VectorGridType > | VectorToScalarConverter<VectorGridType>::Type is the type of a grid having the same tree configuration as VectorGridType but a scalar value type, T, where T is the type of the original vector components |
 VecTraits< T > | |
 VecTraits< math::Vec2< T > > | |
 VecTraits< math::Vec3< T > > | |
 VecTraits< math::Vec4< T > > | |
 VelocityIntegrator< GridT, StaggeredVelocity > | Performs runge-kutta time integration of variable order in a static velocity field |
 VelocitySampler< GridT, StaggeredVelocity > | |
 VersionId | |
 VolumeToMesh | Mesh any scalar grid with a continuous isosurface |
 VoxelSignOp< ValueType > | |