OpenVDB 7.0.0

Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 1 2 3 4 5 6]

▼N openvdb |
▼N v7_0 |
►N compression |
C Page | Stores a variable-size, compressed, delayed-load Page of data that is loaded into memory when accessed. Access to the Page is thread-safe as loading and decompressing the data is protected by a mutex
C PagedInputStream | A Paging wrapper to std::istream that is responsible for reading from a given input stream and creating Page objects and PageHandles that reference those pages for delayed reading
C PagedOutputStream | A Paging wrapper to std::ostream that is responsible for writing from a given output stream at intervals set by the PageSize. As Pages are variable in size, they are flushed to disk as soon as sufficiently large
C PageHandle | A PageHandle holds a unique ptr to a Page and a specific stream pointer to a point within the decompressed Page buffer
►N io |
C Archive | Grid serializer/unserializer
C DelayedLoadMetadata | Store a buffer of data that can be optionally used during reading for faster delayed-load I/O performance
►C File | Grid archive associated with a file on disk
C NameIterator |
C GridDescriptor |
C HalfReader |
C HalfReader< false, T > | Partial specialization for non-floating-point types (no half to float promotion)
C HalfReader< true, T > | Partial specialization for floating-point types
C HalfWriter |
C HalfWriter< false, T > | Partial specialization for non-floating-point types (no float to half quantization)
C HalfWriter< true, T > | Partial specialization for floating-point types
C MappedFile | Handle to control the lifetime of a memory-mapped .vdb file
C MaskCompress |
C MultiPass | Leaf nodes that require multi-pass I/O must inherit from this struct
C Queue | Queue for asynchronous output of grids to files or streams
C RealToHalf | RealToHalf and its specializations define a mapping from floating-point data types to analogous half float types
C RealToHalf< double > |
C RealToHalf< float > |
C RealToHalf< Vec2d > |
C RealToHalf< Vec2s > |
C RealToHalf< Vec3d > |
C RealToHalf< Vec3s > |
C Stream | Grid archive associated with arbitrary input and output streams (not necessarily files)
C StreamMetadata | Container for metadata describing how to unserialize grids from and/or serialize grids to a stream (which file format, compression scheme, etc. to use)
C TempFile | Output stream to a unique temporary file
►N logging |
►N internal |
C ColoredPatternLayout | Log4cplus layout that outputs text in different colors for different log levels, using ANSI escape codes
C LevelScope | A LevelScope object sets the logging level to a given level and restores it to the current level when the object goes out of scope
►N math |
►N internal |
C LegacyFrustum | LegacyFrustum class used at DreamWorks for converting old vdb files
C ReturnValue |
►N pcg |
►N internal |
C CopyOp |
C FillOp |
C LinearOp |
C IncompleteCholeskyPreconditioner | Preconditioner using incomplete Cholesky factorization
C JacobiPreconditioner | Diagonal preconditioner
C Preconditioner | Base class for conjugate gradient preconditioners
►C SparseStencilMatrix | Sparse, square matrix representing a 3D stencil operator of size STENCIL_SIZE
C ConstRow | Read-only accessor to a row of this matrix
C ConstValueIter | Iterator over the stored values in a row of this matrix
C IsFiniteOp |
C MatrixCopyOp |
C RowEditor | Read/write accessor to a row of this matrix
C State | Information about the state of a conjugate gradient solution
►C Vector | Lightweight, variable-length vector
C DeterministicDotProductOp |
C InfNormOp |
C IsFiniteOp |
C AffineMap | A general linear transform using homogeneous coordinates to perform rotation, scaling, shear and translation
C BaseStencil |
C BBox | Axis-aligned bounding box
►C BIAS_SCHEME |
C ISStencil |
►C BIAS_SCHEME< FIRST_BIAS > |
C ISStencil |
►C BIAS_SCHEME< HJWENO5_BIAS > |
C ISStencil |
►C BIAS_SCHEME< SECOND_BIAS > |
C ISStencil |
►C BIAS_SCHEME< THIRD_BIAS > |
C ISStencil |
►C BIAS_SCHEME< WENO5_BIAS > |
C ISStencil |
C BoxStencil |
C CompoundMap | 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
C Conversion | Dummy class for tag dispatch of conversion constructors
C Coord | Signed (x, y, z) 32-bit integer coordinates
►C CoordBBox | Axis-aligned bounding box of signed integer coordinates
C Iterator | Iterator over the Coord domain covered by a CoordBBox
C CPT | Compute the closest-point transform to a level set
C CPT_RANGE | Compute the closest-point transform to a level set
C Curl | Compute the curl of a vector-valued grid using differencing of various orders in the space defined by the range of the map
C Curl< UniformScaleMap, CD_2ND > | Full template specialization of Curl
C Curl< UniformScaleMap, DiffScheme > | Partial template specialization of Curl
C Curl< UniformScaleTranslateMap, CD_2ND > | Full template specialization of Curl
C Curl< UniformScaleTranslateMap, DiffScheme > | Partial template specialization of Curl
C CurvatureStencil |
C D1 |
C D1< BD_1ST > |
C D1< BD_2ND > |
C D1< BD_3RD > |
C D1< BD_HJWENO5 > |
C D1< BD_WENO5 > |
C D1< CD_2ND > |
C D1< CD_2NDT > |
C D1< CD_4TH > |
C D1< CD_6TH > |
C D1< FD_1ST > |
C D1< FD_2ND > |
C D1< FD_3RD > |
C D1< FD_HJWENO5 > |
C D1< FD_WENO5 > |
C D1Vec |
C D1Vec< CD_2ND > |
C D1Vec< CD_2NDT > |
C D1Vec< CD_4TH > |
C D1Vec< CD_6TH > |
C D2 |
C D2< CD_FOURTH > |
C D2< CD_SECOND > |
C D2< CD_SIXTH > |
C DDA | A Digital Differential Analyzer specialized for OpenVDB grids
C Delta | Delta for small floating-point offsets
C Delta< double > |
C Delta< float > |
C DenseStencil | Dense stencil of a given width
C Divergence | Compute the divergence of a vector-valued grid using differencing of various orders, the result defined with respect to the range-space of the map
C Divergence< ScaleMap, CD_2ND > |
C Divergence< ScaleMap, DiffScheme > |
C Divergence< ScaleTranslateMap, CD_2ND > |
C Divergence< ScaleTranslateMap, DiffScheme > |
C Divergence< TranslationMap, DiffScheme > |
C Divergence< UniformScaleMap, CD_2ND > |
C Divergence< UniformScaleMap, DiffScheme > |
C Divergence< UniformScaleTranslateMap, CD_2ND > |
C Divergence< UniformScaleTranslateMap, DiffScheme > |
C Extrema | This class computes the minimum and maximum values of a population of floating-point values
C FourthOrderDenseStencil |
C GenericMap | A wrapper that holds a MapBase::ConstPtr and exposes a reduced set of functionality needed by the mathematical operators
C Gradient | Center difference gradient operators, defined with respect to the range-space of the `map`
C Gradient< ScaleMap, CD_2ND > |
C Gradient< ScaleTranslateMap, CD_2ND > |
C Gradient< TranslationMap, DiffScheme > |
C Gradient< UniformScaleMap, CD_2ND > |
C Gradient< UniformScaleTranslateMap, CD_2ND > |
C GradientBiased | Biased gradient operators, defined with respect to the range-space of the map
C GradientNormSqrd |
C GradientNormSqrd< UniformScaleMap, GradScheme > | Partial template specialization of GradientNormSqrd
C GradientNormSqrd< UniformScaleTranslateMap, GradScheme > | Partial template specialization of GradientNormSqrd
C GradStencil |
C Histogram | This class computes a histogram, with a fixed interval width, of a population of floating-point values
C is_diagonal_jacobian |
C is_double |
C is_double< double > |
C is_linear | Map traits
C is_linear< AffineMap > |
C is_linear< CompoundMap< T1, T2 > > |
C is_linear< ScaleMap > |
C is_linear< ScaleTranslateMap > |
C is_linear< TranslationMap > |
C is_linear< UniformScaleMap > |
C is_linear< UniformScaleTranslateMap > |
C is_linear< UnitaryMap > |
C is_scale |
C is_scale< ScaleMap > |
C is_scale_translate |
C is_scale_translate< ScaleTranslateMap > |
C is_uniform_diagonal_jacobian |
C is_uniform_scale |
C is_uniform_scale< UniformScaleMap > |
C is_uniform_scale_translate |
C is_uniform_scale_translate< TranslationMap > |
C is_uniform_scale_translate< UniformScaleTranslateMap > |
C is_vec3d |
C is_vec3d< Vec3d > |
C ISCurl | Curl operator defined in index space using various first derivative schemes
C ISDivergence | Divergence operator defined in index space using various first derivative schemes
C ISGradient | Gradient operators defined in index space of various orders
C ISGradientBiased | Biased Gradient Operators, using upwinding defined by the `Vec3Bias` input
C ISGradientNormSqrd |
C ISLaplacian | Laplacian defined in index space, using various center-difference stencils
C ISLaplacian< CD_FOURTH > |
C ISLaplacian< CD_SECOND > |
C ISLaplacian< CD_SIXTH > |
C ISMeanCurvature | Compute the mean curvature in index space
C ISOpMagnitude | Adapter for vector-valued index-space operators to return the vector magnitude
C Laplacian | 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
C Laplacian< ScaleMap, DiffScheme > |
C Laplacian< ScaleTranslateMap, DiffScheme > |
C Laplacian< TranslationMap, DiffScheme > |
C Laplacian< UniformScaleMap, DiffScheme > |
C Laplacian< UniformScaleTranslateMap, DiffScheme > |
C Laplacian< UnitaryMap, DiffScheme > |
C LevelSetHDDA | Helper class that implements Hierarchical Digital Differential Analyzers and is specialized for ray intersections with level sets
C LevelSetHDDA< TreeT, -1 > | Specialization of Hierarchical Digital Differential Analyzer class that intersects a ray against the voxels of a level set
C MapAdapter | Adapter to associate a map with a world-space operator, giving it the same call signature as an index-space operator
C MapBase | Abstract base class for maps
C MapRegistry | Threadsafe singleton object for accessing the map type-name dictionary. Associates a map type-name with a factory function
C Mat |
C Mat2 |
C Mat3 | 3x3 matrix class
C Mat4 | 4x4 -matrix class
C MeanCurvature | Compute the mean curvature
C MeanCurvature< TranslationMap, DiffScheme2, DiffScheme1 > |
C MeanCurvature< UniformScaleMap, DiffScheme2, DiffScheme1 > |
C MeanCurvature< UniformScaleTranslateMap, DiffScheme2, DiffScheme1 > |
C MinMax | Templated class to compute the minimum and maximum values
C NineteenPointStencil |
C NonlinearFrustumMap | This map is composed of three steps. First it will take a box of size (Lx X Ly X Lz) defined by a member data bounding box and map it into a frustum with near plane (1 X Ly/Lx) and prescribed depth Then this frustum is transformed by an internal second map: most often a uniform scale, but other effects can be achieved by accumulating translation, shear and rotation: these are all applied to the second map
C OpMagnitude | Adapter for vector-valued world-space operators to return the vector magnitude
C promote |
C QuantizedUnitVec | Unit vector occupying only 16 bits
C Quat |
C Rand01 | Simple generator of random numbers over the range [0, 1)
C RandInt | Simple random integer generator
►C Ray |
C TimeSpan |
C ScaleMap | A specialized Affine transform that scales along the principal axis the scaling need not be uniform in the three-directions
C 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
C SecondOrderDenseStencil |
C SevenPointStencil |
C SixthOrderDenseStencil |
C Stats | This class computes statistics (minimum value, maximum value, mean, variance and standard deviation) of a population of floating-point values
C ThirteenPointStencil |
C Tolerance | Tolerance for floating-point comparison
C Tolerance< double > |
C Tolerance< float > |
C Transform |
C TranslationMap | A specialized linear transform that performs a translation
C Tuple |
C UniformScaleMap | A specialized Affine transform that scales along the principal axis the scaling is uniform in the three-directions
C UniformScaleTranslateMap | A specialized Affine transform that uniformaly scales along the principal axis and then translates the result
C UnitaryMap | A specialized linear transform that performs a unitary maping i.e. rotation and or reflection
C Vec2 |
C Vec3 |
C Vec4 |
C VolumeHDDA | Helper class that implements Hierarchical Digital Differential Analyzers for ray intersections against a generic volume
C VolumeHDDA< TreeT, RayT, 0 > | Specialization of Hierarchical Digital Differential Analyzer class that intersects against the leafs or tiles of a generic volume
C WenoStencil | This is a special 19-point stencil that supports optimal fifth-order WENO upwinding, second-order central differencing, Laplacian, and zero-crossing test
►N points |
►N attribute_traits |
C StringTypeTrait |
C StringTypeTrait< true > |
C TruncateTrait |
C TruncateTrait< float > |
C TruncateTrait< int > |
C TruncateTrait< math::Vec3< T > > |
C UIntTypeTrait |
C UIntTypeTrait< false, math::Vec3< T > > |
C UIntTypeTrait< false, T > |
C UIntTypeTrait< true, math::Vec3< T > > |
C UIntTypeTrait< true, T > |
►N future | A container for ABI=5 to help ease introduction of upcoming features
C Advect |
C Container |
►N internal |
C PointDataNodeChain | Recursive node chain which generates a boost::mpl::vector listing value converted types of nodes to PointDataGrid nodes of the same configuration, rooted at RootNodeType in reverse order, from LeafNode to RootNode. See also TreeConverter<>
C PointDataNodeChain< tree::InternalNode< ChildT, Log2Dim >, 1 > |
C PointDataNodeChain< tree::InternalNode< ChildT, Log2Dim >, HeadLevel > |
►N point_advect_internal |
C AdvectionDeformer |
C AdvectionOp |
►N point_attribute_internal |
C AttributeTypeConversion |
C AttributeTypeConversion< Name, CodecType > |
C Default |
C MetadataStorage |
C MetadataStorage< PointDataTreeT, Name > |
►N point_conversion_internal |
C CalculatePositionBounds |
C ConversionTraits |
C ConversionTraits< openvdb::Name > |
C ConvertPointDataGridAttributeOp |
C ConvertPointDataGridGroupOp |
C ConvertPointDataGridPositionOp |
C PopulateAttributeOp |
►N point_delete_internal |
C DeleteByFilterOp |
C VectorWrapper |
►N point_group_internal |
C CopyGroupOp | Copy a group attribute value from one group offset to another
C GroupInfo | Convenience class with methods for analyzing group data
C SetGroupByFilterOp |
C SetGroupFromIndexOp |
C SetGroupOp | Set membership on or off for the specified group
►N point_mask_internal |
C GridCombinerOp | Combines multiple grids into one by stealing leaf nodes and summing voxel values This class is designed to work with thread local storage containers such as tbb::combinable
C PointsToScalarOp | Compute scalar grid from PointDataGrid while evaluating the point filter
C PointsToTransformedScalarOp | Compute scalar grid from PointDataGrid using a different transform and while evaluating the point filter
►N point_move_internal |
C BuildMoveMapsOp |
►C GlobalMovePointsOp |
C CopyIterator |
►C LocalMovePointsOp |
C CopyIterator |
►N point_sample_internal |
C AppendAttributeOp |
C AppendAttributeOp< PointDataGridT, DummySampleType > |
C CompatibleTypes |
C CompatibleTypes< math::Vec2< T >, math::Vec2< T > > |
C CompatibleTypes< math::Vec2< T0 >, math::Vec2< T1 > > |
C CompatibleTypes< math::Vec3< T >, math::Vec3< T > > |
C CompatibleTypes< math::Vec3< T0 >, math::Vec3< T1 > > |
C CompatibleTypes< math::Vec4< T >, math::Vec4< T > > |
C CompatibleTypes< math::Vec4< T0 >, math::Vec4< T1 > > |
C CompatibleTypes< T, math::Vec2< T > > |
C CompatibleTypes< T, math::Vec3< T > > |
C CompatibleTypes< T, math::Vec4< T > > |
C CompatibleTypes< T, T > |
C CompatibleTypes< ValueMask, T > |
C PointDataSampler |
C SamplerTraits |
C SamplerTraits< tools::Sampler< T0, T1 > > |
C SampleWithRoundingOp |
C SampleWithRoundingOp< ValueT, SamplerT, AccessorT, false, true > |
C SampleWithRoundingOp< ValueT, SamplerT, AccessorT, true, true > |
C AccessorEval | Accessor to call unsafe get and set methods based on templated Codec and Value
C AccessorEval< UnknownCodec, ValueType > | Partial specialization when Codec is not known at compile-time to use the supplied functor instead
►C AttributeArray | Base class for storing attribute data
C Accessor |
C AccessorBase | Accessor base class for AttributeArray storage where type is not available
C ScopedRegistryLock |
C AttributeHandle |
C AttributeHashFilter |
►C AttributeSet | Ordered collection of uniquely-named attribute arrays
C Inserter | Utility method to construct a NameAndType sequence
►C Util |
C NameAndType | Attribute and type name pair
C AttributeWriteHandle | Write-able version of AttributeHandle
C BBoxFilter |
C BinaryFilter |
►C CachedDeformer | A Deformer that caches the resulting positions from evaluating another Deformer
►C Cache |
C Leaf |
C DeformerTraits | Deformer Traits for optionally configuring deformers to be applied in index-space. The default is world-space
C DummySampleType |
C FilterTraits |
C FilterTraits< BBoxFilter > |
C FilterTraits< BinaryFilter< T0, T1, And > > |
C FilterTraits< LevelSetFilter< T > > |
►C FixedPointCodec |
C Storage |
►C GroupCodec |
C Storage |
C GroupFilter | Index filtering on group membership
►C GroupHandle |
C BitMask |
C GroupWriteHandle |
►C IndexIter | A forward iterator over array indices with filtering IteratorT can be either IndexIter or ValueIndexIter (or some custom index iterator) FilterT should be a struct or class with a valid() method than can be evaluated per index Here's a simple filter example that only accepts even indices:
C ValueIndexIter | A forward iterator over array indices from a value iterator (such as ValueOnCIter)
C LevelSetFilter |
C MultiGroupFilter |
►C NullCodec |
C Storage |
C NullDeformer | No-op deformer (adheres to the deformer interface documented in PointMove.h)
C NullFilter | A no-op filter that can be used when iterating over all indices
C PointAttributeVector | Point-partitioner compatible STL vector attribute wrapper for convenience
C PointDataLeafNode |
C PositionRange |
C RandomLeafFilter |
C SampleWithRounding |
C StringAttributeHandle |
C StringAttributeWriteHandle |
►C StringCodec |
C Storage |
C StringMetaInserter |
C TreeConverter | Similiar to ValueConverter, but allows for tree configuration conversion to a PointDataTree. ValueConverter<PointDataIndex32> cannot be used as a PointDataLeafNode is not a specialization of LeafNode
►C TruncateCodec |
C Storage |
C TypedAttributeArray | Typed class for storing attribute data
C UnitRange |
►C UnitVecCodec |
C Storage |
C UnknownCodec |
C ValueMaskFilter | Index filtering on active / inactive state of host voxel
►C ValueVoxelCIter | A forward iterator over array indices in a single voxel
C Parent |
►N tools |
►N activation |
C ActivationOp |
►N clip_internal |
C BoolSampler |
C ConvertGrid |
C ConvertGrid< GridT, GridT > |
C CopyLeafNodes |
C MaskInteriorVoxels |
►N composite |
C BuildPrimarySegment |
C BuildSecondarySegment |
C GridOrTreeConstructor |
C GridOrTreeConstructor< Grid< TreeType > > |
►N diagnostics_internal |
C InactiveTileValues |
C InactiveVoxelValues |
►N ds |
C CompositeFunctorTranslator | Translator that converts an enum to compositing functor types
C CompositeFunctorTranslator< DS_ADD, ValueT > |
C CompositeFunctorTranslator< DS_MAX, ValueT > |
C CompositeFunctorTranslator< DS_MIN, ValueT > |
C CompositeFunctorTranslator< DS_MULT, ValueT > |
C CompositeFunctorTranslator< DS_OVER, ValueT > |
C CompositeFunctorTranslator< DS_SUB, ValueT > |
C OpAdd |
C OpMax |
C OpMin |
C OpMult |
C OpOver | Point wise methods used to apply various compositing operations
C OpSub |
►N gridop |
C GridOperator | Apply an operator to an input grid to produce an output grid with the same active voxel topology but a potentially different value type
C ToMaskGrid | ToMaskGrid<T>::Type is the type of a grid having the same tree hierarchy as grid type T but a value equal to its active state
►N internal |
C PointListTransform |
C PrimCpy |
C TileSampler | 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
C TileSampler< PointSampler, TreeT > | For point sampling, tree traversal is less expensive than testing bounding box membership
C TileSampler< StaggeredPointSampler, TreeT > | For point sampling, tree traversal is less expensive than testing bounding box membership
►N level_set_fracture_internal |
C FindMinMaxVoxelValue |
►N level_set_util_internal |
C ComputeActiveVoxelCount |
C ConnectNodeMaskSegments |
C ExpandLeafNodeRegion |
C ExpandNarrowbandMask |
C FillLeafNodeVoxels |
C FillMaskBoundary |
C FindMinTileValue |
C FindMinVoxelValue |
C FlipRegionSign |
C FloodFillSign |
C GreaterCount |
C GridOrTreeConstructor |
C GridOrTreeConstructor< Grid< TreeType > > |
C LabelBoundaryVoxels | Negative active values are set `0`, everything else is set to `1`
C MaskedCopy |
C MaskInteriorTiles |
C MaskInteriorVoxels |
C MaskIsovalueCrossingVoxels |
C MaskSegmentGroup |
C NodeMaskSegment |
C PopulateTree |
C SDFTilesToFogVolume |
C SDFVoxelsToFogVolume |
C SegmentNodeMask |
►N mesh_to_volume_internal |
C AddNodes |
C CombineLeafNodes |
C ComputeIntersectingVoxelSign |
C ComputeNodeConnectivity |
C ConstructVoxelMask |
C DiffLeafNodeMask |
►C ExpandNarrowband |
C Fragment |
C FillArray |
C InactivateValues |
C LeafNodeConnectivityTable |
C MinCombine |
C OffsetValues |
C ReleaseChildNodes |
►C RemoveSelfIntersectingSurface |
C Comp |
C Renormalize |
C RestoreOrigin |
C SeedFillExteriorSign |
C SeedPoints |
C StashOriginAndStoreOffset |
C StealUniqueLeafNodes |
C SweepExteriorSign |
C SyncVoxelMask |
C Tolerance |
C TransformPoints |
C TransformValues |
C UnionValueMasks |
►C ValidateIntersectingVoxels |
C IsNegative |
C VoxelizationData | TBB body object to voxelize a mesh of triangles and/or quads into a collection of VDB grids, namely a squared distance grid, a closest primitive grid and an intersecting voxels grid (masks the mesh intersecting voxels)
C VoxelizePolygons |
►N particle_atlas_internal |
C BBoxFilter |
C ComputeExtremas |
C RadialRangeFilter |
C RemapIndices |
C SplittableParticleArray |
►N point_index_grid_internal |
C BBoxFilter |
C PopulateLeafNodesOp |
C RadialRangeFilter |
C ValidPartitioningOp |
►N point_partitioner_internal |
C Array |
C BinPointIndicesOp |
C ComputePointOrderOp |
C CreateOrderedPointIndexArrayOp |
C LeafNodeOriginOp |
C MergeBinsOp |
C MoveSegmentDataOp |
C OrderSegmentsOp |
C VoxelOrderOp |
►N poisson |
►N internal |
C CopyFromVecOp | Functor for use with LeafManager::foreach() to populate a tree with values from a vector
C CopyToVecOp | Functor for use with LeafManager::foreach() to populate a vector with the values of a tree's active voxels
C ISLaplacianOp | Functor for use with LeafManager::foreach() to populate a sparse Laplacian matrix
C ISStaggeredLaplacianOp | Functor for use with LeafManager::foreach() to populate a sparse Laplacian matrix
C LeafCountOp | Functor for use with LeafManager::foreach() to populate an array with per-leaf active voxel counts
C LeafIndexOp | Functor for use with LeafManager::foreach() to populate active leaf voxels with sequential indices
C DirichletBoundaryOp | Dirichlet boundary condition functor
►N potential_flow_internal |
C ComputeNeumannVelocityOp |
C SolveBoundaryOp |
►N stats_internal |
C GetVal |
C GetValImpl |
C GetValImpl< T, false > |
C GetValImpl< T, true > |
C HistOp |
C IterTraits |
C IterTraits< tree::TreeValueIteratorBase< TreeT, ValueIterT > > |
C MathOp |
C StatsOp |
►N ttls_internal |
C DilateOp |
C ErodeOp |
C OffsetAndMinComp |
►N v2s_internal |
C ClosestPointDist |
C LeafOp |
C NodeOp |
C PointAccessor |
C UpdatePoints |
►N valxform |
C CopyableOpApplier |
C CopyableOpTransformer |
C MaxOp |
C MinOp |
C MultOp |
C OpAccumulator |
C SharedOpApplier |
C SharedOpTransformer |
C SumOp |
C SumOp< bool > |
►N volume_to_mesh_internal |
C AdaptiveLeafNodePointCount |
C AdaptivePrimBuilder |
C ComputeAuxiliaryData |
C ComputePoints |
C ComputePolygons |
C CopyArray |
C FillArray |
C FlagAndCountQuadsToSubdivide |
C IdentifyIntersectingVoxels |
C LeafNodePointCount |
C LeafNodeVoxelOffsets |
C MapPoints |
C MaskBorderVoxels |
C MaskDisorientedTrianglePoints |
C MaskIntersectingVoxels |
C MaskSeamLineVoxels |
C MaskSurface |
C MaskTileBorders |
C MergeVoxelRegions |
C PointListCopy |
C ReviseSeamLineFlags |
C SeamLineWeights |
C SetSeamLineFlags |
C SubdivideQuads |
C SyncMaskValues |
C TransferSeamLineFlags |
C UniformPrimBuilder |
C VoxelEdgeAccessor | Utility method to marks all voxels that share an edge
C 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
C AlphaMask |
C BaseCamera | Abstract base class for the perspective and orthographic cameras
C BasePointScatter | Forward declaration of base class
C BaseShader | Abstract base class for the shaders
C BoxSampler |
C ChangeBackgroundOp |
C ChangeLevelSetBackgroundOp |
C CheckDivergence | Checks the divergence against a range
C CheckEikonal | Checks the norm of the gradient at zero-crossing voxels against a range
C CheckFinite | Checks for both NaN and inf values, i.e. any value that is not finite
C CheckFogVolume | Class that performs various types of checks on fog volumes
C CheckInf | Checks for infinite values, e.g. 1/0 or -1/0
C CheckLevelSet | Class that performs various types of checks on narrow-band level sets
C CheckMagnitude | Check that the magnitude of a value, a, is close to a fixed magnitude, b, given a fixed tolerance c. That is | |a| - |b| | <= c
C CheckMax | Checks a value against a maximum
C CheckMin | Checks a value against a minimum
C CheckNan | Checks NaN values
C CheckNormGrad | Checks the norm of the gradient against a range, i.e., |∇Φ| ∈ [min, max]
C CheckRange | Checks a value against a range
C ClosestPointProjector |
C ClosestSurfacePoint | Accelerated closest surface point queries for narrow band level sets
C CompReplaceOp |
C ConstrainedPointAdvect |
C ContiguousOp | Wrapper struct used to avoid unnecessary computation of memory access from `Coord` when all offsets are guaranteed to be within the dense grid
C CopyFromDense | Copy the values from a dense grid into an OpenVDB tree
C CopyToDense | Copy an OpenVDB tree into an existing dense grid
C Cpt | Compute the closest-point transform of a scalar grid
C CsgDiffVisitor |
C CsgIntersectVisitor |
C CsgUnionVisitor |
C CsgVisitorBase |
C Curl | Compute the curl of a vector grid
C Dense | Dense is a simple dense grid API used by the CopyToDense and CopyFromDense classes defined below
C DenseBase | Base class for Dense which is defined below
C DenseBase< ValueT, LayoutXYZ > | Partial template specialization of DenseBase
C DenseBase< ValueT, LayoutZYX > | Partial template specialization of DenseBase
C DenseTransformer | Class that applies a functor to the index space intersection of a prescribed bounding box and the dense grid. NB: This class only supports DenseGrids with ZYX memory layout
C DenseUniformPointScatter | Scatters a fixed (and integer) number of points in all active voxels and tiles
C Diagnose | Performs multithreaded diagnostics of a grid
C DiffuseShader | Simple diffuse Lambertian surface shader
C DiffuseShader< Film::RGBA, SamplerType > |
C DilationOp | Class that performs multi-threaded dilation with support for active tiles
C DimToWord | Mapping from a Log2Dim to a data type of size 2^Log2Dim bits
C DimToWord< 3 > |
C DimToWord< 4 > |
C DimToWord< 5 > |
C DimToWord< 6 > |
C DiracDelta | Smeared-out and continuous Dirac Delta function
C DiscreteField | Thin wrapper class for a velocity grid
►C Divergence | Compute the divergence of a vector grid
C Functor |
C DSConverter |
C DualGridSampler | This is a simple convenience class that allows for sampling from a source grid into the index space of a target grid. At construction the source and target grids are checked for alignment which potentially renders interpolation unnecessary. Else interpolation is performed according to the templated Sampler type
C DualGridSampler< tree::ValueAccessor< TreeT >, SamplerT > | Specialization of DualGridSampler for construction from a ValueAccessor type
C EnrightField | Analytical, divergence-free and periodic velocity field
C ExtractAll | Simple utility class used by `extractSparseTreeWithMask`
►C Film | A simple class that allows for concurrent writes to pixels in an image, background initialization of the image, and PPM or EXR file output
C RGBA | Floating-point RGBA components in the range [0, 1]
C Filter | Volume filtering (e.g., diffusion) with optional alpha masking
►C FindActiveValues | Finds the active values in a tree which intersects a bounding box
C NodePairT |
►C Gradient | Compute the gradient of a scalar grid
C Functor |
C GridResampler |
C GridSampler | Class that provides the interface for continuous sampling of values in a tree
C GridSampler< tree::ValueAccessor< TreeT >, SamplerType > | Specialization of GridSampler for construction from a ValueAccessor type
►C 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
C MatrixTransform |
C HomogeneousMatMul |
C InactivePruneOp |
►C Laplacian |
C Functor |
C LevelSetAdvection | Hyperbolic advection of narrow-band level sets in an external velocity field
C LevelSetFilter | Filtering (e.g. diffusion) of narrow-band level sets. An optional scalar field can be used to produce a (smooth) alpha mask for the filtering
C LevelSetFracture | Level set fracturing
C LevelSetMeasure | Multi-threaded computation of surface area, volume and average mean-curvature for narrow band level sets
C LevelSetMorphing | Shape morphology of level sets. Morphing from a source narrow-band level sets to a target narrow-band level set
C LevelSetPruneOp |
C LevelSetRayIntersector | This class provides the public API for intersecting a ray with a narrow-band level set
C LevelSetRayTracer | A (very) simple multithreaded ray tracer specifically for narrow-band level sets
C LevelSetSphere | Generates a signed distance field (or narrow band level set) to a single sphere
►C LevelSetTracker | Performs multi-threaded interface tracking of narrow band level sets
C State | Lightweight struct that stores the state of the LevelSetTracker
C LinearSearchImpl | Implements linear iterative search for an iso-value of the level set along the direction of the ray
►C Magnitude |
C Functor |
C OpT |
C MatMul |
C MatMulNormalize |
C MatteShader | Shader that produces a simple matte
C MatteShader< Film::RGBA, SamplerType > |
►C MeanCurvature |
C Functor |
►C MeshToVoxelEdgeData | Extracts and stores voxel edge intersection data from a mesh
C EdgeData | Internal edge data type
C GenEdgeData |
►C Morphology |
C CopyMasks |
C ErodeVoxelsOp |
C LeafCache |
C MaskManager |
C Neighbor |
C UpdateMasks |
►C MultiResGrid |
C MaskOp |
C ProlongateOp |
C RestrictOp |
C NonUniformPointScatter | Non-uniform scatters of point in the active voxels. The local point count is implicitly defined as a product of of a global density (called pointsPerVolume) and the local voxel (or tile) value
►C Normalize |
C Functor |
C OpT |
C NormalShader | Color shader that treats the surface normal (x, y, z) as an RGB color
C NormalShader< Film::RGBA, SamplerType > |
C OrthographicCamera |
►C ParticleAtlas |
C Iterator | Provides accelerated range and nearest-neighbor searches for particles that are partitioned using the ParticleAtlas
C ParticlesToLevelSet |
C PerspectiveCamera |
C PointAdvect |
C PointIndexFilter |
C PointIndexIterator | Accelerated range and nearest-neighbor searches for point index grids
C PointIndexLeafNode |
►C PointPartitioner |
C IndexIterator |
C PointSampler |
►C PointsToMask | Makes every voxel of a grid active if it contains a point
C ReducePool |
C PolygonPool | Collection of quads and triangles
C PositionShader | Color shader that treats position (x, y, z) as an RGB color in a cube defined from an axis-aligned bounding box in world space
C PositionShader< Film::RGBA, SamplerType > |
C QuadAndTriangleDataAdapter | Contiguous quad and triangle data adapter class
C QuadraticSampler |
C Sampler | Provises a unified interface for sampling, i.e. interpolation
C Sampler< 0, false > |
C Sampler< 0, true > |
C Sampler< 1, false > |
C Sampler< 1, true > |
C Sampler< 2, false > |
C Sampler< 2, true > |
C ScalarToVectorConverter | 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
C SignedFloodFillOp |
C SparseExtractor | Functor-based class used to extract data that satisfies some criteria defined by the embedded `OpType` functor. The `extractSparseTree` function wraps this class
C SparseMaskedExtractor | Functor-based class used to extract data from a dense grid, at the index-space intersection with a supplied mask in the form of a sparse tree. The `extractSparseTreeWithMask` function wraps this class
C SparseToDenseCompositor |
C StaggeredBoxSampler |
C StaggeredPointSampler |
C StaggeredQuadraticSampler |
C TolerancePruneOp |
C UniformPointScatter | The two point scatters UniformPointScatter and NonUniformPointScatter depend on the following two classes:
C VectorToScalarConverter | 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
C VectorToScalarGrid | Metafunction to convert a vector-valued grid type to a scalar grid type
C VelocityIntegrator | Performs Runge-Kutta time integration of variable order in a static velocity field
C VelocitySampler |
C VolumeAdvection | Performs advections of an arbitrary type of volume in a static velocity field. The advections are performed by means of various derivatives of Semi-Lagrangian integration, i.e. backwards tracking along the hyperbolic characteristics followed by interpolation
C VolumeRayIntersector | This class provides the public API for intersecting a ray with a generic (e.g. density) volume
C VolumeRender | A (very) simple multithreaded volume render specifically for scalar density
C VolumeToMesh | Mesh any scalar grid that has a continuous isosurface
►N tree |
►N internal |
C LeafBufferFlags |
►N iter |
C InvertedTree |
C InvertedTree< HeadT, 1 > |
►N leafmgr |
C TreeTraits | Useful traits for Tree types
C TreeTraits< const TreeT > |
C CacheItem |
C CacheItem< TreeCacheT, NodeVecT, true > | The tail of a compile-time list of cached node pointers, ordered from LeafNode to RootNode
C CombineOpAdapter | Helper class to adapt a three-argument (a, b, result) CombineOp functor into a single-argument functor that accepts a CombineArgs struct
C CopyTraits |
C CopyTraits< math::Coord > |
C CopyTraits< math::Vec2< T > > |
C CopyTraits< math::Vec3< T > > |
C CopyTraits< math::Vec4< T > > |
C DenseIteratorBase | Base class for dense iterators over internal and leaf nodes
►C InternalNode |
C ChildAll |
C ChildIter |
C ChildOff |
C ChildOn |
C DeepCopy |
C DenseIter |
C SameConfiguration | SameConfiguration<OtherNodeType>::value is `true` if and only if OtherNodeType is the type of an InternalNode with the same dimensions as this node and whose ChildNodeType has the same configuration as this node's ChildNodeType
C TopologyCopy1 |
C TopologyCopy2 |
►C TopologyDifference |
C A |
C B |
►C TopologyIntersection |
C A |
►C TopologyUnion |
C A |
C ValueAll |
C ValueConverter | 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
C ValueIter |
C ValueOff |
C ValueOn |
C VoxelizeActiveTiles |
C IteratorBase | Base class for iterators over internal and leaf nodes
C IteratorRange |
C IterListItem | An IterListItem is an element of a compile-time linked list of iterators to nodes of different types
C IterListItem< PrevItemT, NodeVecT, 1, _Level > | The final element of a compile-time linked list of iterators to nodes of different types
C IterListItem< PrevItemT, NodeVecT, VecSize, 0U > | The initial element of a compile-time linked list of iterators to nodes of different types
C IterTraits |
►C IterTraits< NodeT, typename NodeT::ChildAllCIter > |
C NodeConverter |
►C IterTraits< NodeT, typename NodeT::ChildAllIter > |
C NodeConverter |
►C IterTraits< NodeT, typename NodeT::ChildOffCIter > |
C NodeConverter |
►C IterTraits< NodeT, typename NodeT::ChildOffIter > |
C NodeConverter |
►C IterTraits< NodeT, typename NodeT::ChildOnCIter > |
C NodeConverter |
►C IterTraits< NodeT, typename NodeT::ChildOnIter > |
C NodeConverter |
►C IterTraits< NodeT, typename NodeT::ValueAllCIter > |
C NodeConverter |
►C IterTraits< NodeT, typename NodeT::ValueAllIter > |
C NodeConverter |
►C IterTraits< NodeT, typename NodeT::ValueOffCIter > |
C NodeConverter |
►C IterTraits< NodeT, typename NodeT::ValueOffIter > |
C NodeConverter |
►C IterTraits< NodeT, typename NodeT::ValueOnCIter > |
C NodeConverter |
►C IterTraits< NodeT, typename NodeT::ValueOnIter > |
C NodeConverter |
►C LeafBuffer | Array of fixed size 23Log2Dim that stores the voxel values of a LeafNode
C FileInfo |
C LeafBuffer< bool, Log2Dim > |
C LeafIteratorBase | Base class for tree-traversal iterators over all leaf nodes (but not leaf voxels)
►C LeafManager | This class manages a linear array of pointers to a given tree's leaf nodes, as well as optional auxiliary buffers (one or more per leaf) that can be swapped with the leaf nodes' voxel data buffers
►C LeafRange |
C Iterator |
C LeafManagerImpl |
C LeafManagerImpl< LeafManager< const TreeT > > |
►C LeafNode | Templated block class to hold specific data types and a fixed number of values determined by Log2Dim. The actual coordinate dimension of the block is 2^Log2Dim, i.e. Log2Dim=3 corresponds to a LeafNode that spans a 8^3 block
C ChildAll |
C ChildIter | Leaf nodes have no children, so their child iterators have no get/set accessors
C ChildOff |
C ChildOn |
C DenseIter |
C SameConfiguration | SameConfiguration<OtherNodeType>::value is `true` if and only if OtherNodeType is the type of a LeafNode with the same dimensions as this node
C ValueAll |
C ValueConverter | ValueConverter<T>::Type is the type of a LeafNode having the same dimensions as this node but a different value type, T
C ValueIter |
C ValueOff |
C ValueOn |
►C 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
C ChildIter | Leaf nodes have no children, so their child iterators have no get/set accessors
C DenseIter |
C SameConfiguration | SameConfiguration<OtherNodeType>::value is `true` if and only if OtherNodeType is the type of a LeafNode with the same dimensions as this node
C ValueConverter | ValueConverter<T>::Type is the type of a LeafNode having the same dimensions as this node but a different value type, T
C ValueIter |
►C LeafNode< ValueMask, Log2Dim > | LeafNode specialization for values of type ValueMask that encodes both the active states and the boolean values of (2^Log2Dim)^3 voxels in a single bit mask, i.e. voxel values and states are indistinguishable!
C ChildIter | Leaf nodes have no children, so their child iterators have no get/set accessors
C DenseIter |
C SameConfiguration | SameConfiguration<OtherNodeType>::value is `true` if and only if OtherNodeType is the type of a LeafNode with the same dimensions as this node
C ValueConverter | ValueConverter<T>::Type is the type of a LeafNode having the same dimensions as this node but a different value type, T
C ValueIter |
C NodeChain | NodeChain<RootNodeType, RootNodeType::LEVEL>::Type is a boost::mpl::vector that lists the types of the nodes of the tree rooted at RootNodeType in reverse order, from LeafNode to RootNode
C NodeChain< HeadT, 1 > | Specialization to terminate NodeChain
C NodeIteratorBase | Base class for tree-traversal iterators over all nodes
►C NodeList | This class caches tree nodes of a specific type in a linear array
►C NodeRange |
C Iterator |
C NodeManager | To facilitate threading over the nodes of a tree, cache node pointers in linear arrays, one for each level of the tree
C NodeManagerLink | This class is a link in a chain that each caches tree nodes of a specific type in a linear array
C NodeUnion |
C NodeUnion< ValueT, ChildT, typename std::enable_if< CopyTraits< ValueT >::IsCopyable >::type > |
C NodeUnion< ValueT, ChildT, typename std::enable_if< std::is_pod< ValueT >::value >::type > |
►C RootNode |
C SameConfiguration | SameConfiguration<OtherNodeType>::value is `true` if and only if OtherNodeType is the type of a RootNode whose ChildNodeType has the same configuration as this node's ChildNodeType
C ValueConverter | ValueConverter<T>::Type is the type of a RootNode having the same child hierarchy as this node but a different value type, T
C RootNodeCombineHelper |
C RootNodeCombineHelper< CombineOp, RootT, OtherRootT, true > |
C RootNodeCopyHelper |
C RootNodeCopyHelper< RootT, OtherRootT, true > |
C SameInternalConfig |
C SameInternalConfig< ChildT1, Dim1, InternalNode< ChildT2, Dim1 > > |
C SameLeafConfig |
C SameLeafConfig< Dim1, LeafNode< T2, Dim1 > > |
C SameLeafConfig< Dim1, openvdb::tools::PointIndexLeafNode< T2, Dim1 > > |
C SameLeafConfig< Dim1, points::PointDataLeafNode< T2, Dim1 > > |
C SameRootConfig |
C SameRootConfig< ChildT1, RootNode< ChildT2 > > |
C SparseIteratorBase | Base class for sparse iterators over internal and leaf nodes
►C Tree |
C DeallocateNodes |
C ValueConverter | ValueConverter<T>::Type is the type of a tree having the same hierarchy as this tree but a different value type, T
C Tree3 | Tree3<T, N1, N2>::Type is the type of a three-level tree (Root, Internal, Leaf) with value type T and internal and leaf node log dimensions N1 and N2, respectively
C Tree4 | Tree4<T, N1, N2, N3>::Type is the type of a four-level tree (Root, Internal, Internal, Leaf) with value type T and internal and leaf node log dimensions N1, N2 and N3, respectively
C Tree5 | Tree5<T, N1, N2, N3, N4>::Type is the type of a five-level tree (Root, Internal, Internal, Internal, Leaf) with value type T and internal and leaf node log dimensions N1, N2, N3 and N4, respectively
C TreeBase | Base class for typed trees
C TreeIterTraits | TreeIterTraits provides, for all tree iterators, a begin(tree) function that returns an iterator over a tree of arbitrary type
C TreeIterTraits< TreeT, typename TreeT::LeafCIter > |
C TreeIterTraits< TreeT, typename TreeT::LeafIter > |
C TreeIterTraits< TreeT, typename TreeT::NodeCIter > |
C TreeIterTraits< TreeT, typename TreeT::NodeIter > |
C TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildAllCIter > |
C TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildAllIter > |
C TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildOffCIter > |
C TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildOffIter > |
C TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildOnCIter > |
C TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildOnIter > |
C TreeIterTraits< TreeT, typename TreeT::ValueAllCIter > |
C TreeIterTraits< TreeT, typename TreeT::ValueAllIter > |
C TreeIterTraits< TreeT, typename TreeT::ValueOffCIter > |
C TreeIterTraits< TreeT, typename TreeT::ValueOffIter > |
C TreeIterTraits< TreeT, typename TreeT::ValueOnCIter > |
C TreeIterTraits< TreeT, typename TreeT::ValueOnIter > |
C TreeValueIteratorBase | Base class for tree-traversal iterators over tile and voxel values
C ValueAccessor |
C ValueAccessor0 | ValueAccessor with no mutex and no node caching
C ValueAccessor1 | Value accessor with one level of node caching
C ValueAccessor2 | Value accessor with two levels of node caching
C ValueAccessor3 | Value accessor with three levels of node caching
C ValueAccessor< TreeType, IsSafe, 0, tbb::null_mutex > | Template specialization of the ValueAccessor with no mutex and no cache levels
C ValueAccessor< TreeType, IsSafe, 1, tbb::null_mutex > | Template specialization of the ValueAccessor with no mutex and one cache level
C ValueAccessor< TreeType, IsSafe, 2, tbb::null_mutex > | Template specialization of the ValueAccessor with no mutex and two cache levels
C ValueAccessor< TreeType, IsSafe, 3, tbb::null_mutex > | Template specialization of the ValueAccessor with no mutex and three cache levels
C ValueAccessorBase | 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
C ValueAccessorRW | This accessor is thread-safe (at the cost of speed) for both reading and writing to a tree. That is, multiple threads may safely access a single, shared ValueAccessorRW
►N util |
C BaseMaskIterator | Base class for the bit mask iterators
C CpuTimer | Simple timer for basic profiling
C DenseMaskIterator |
C FormattedInt | I/O manipulator that formats integer values with thousands separators
C LeafTopologyDiffOp | Functor for use with tools::foreach() to compute the boolean difference between the value masks of corresponding leaf nodes in two trees
C LeafTopologyIntOp | Functor for use with tools::foreach() to compute the boolean intersection between the value masks of corresponding leaf nodes in two trees
C NodeMask | Bit mask for the internal and leaf nodes of VDB. This is a 64-bit implementation
C NodeMask< 1 > | Template specialization of NodeMask for Log2Dim=1, i.e. 2^3 nodes
C NodeMask< 2 > | Template specialization of NodeMask for Log2Dim=2, i.e. 4^3 nodes
C NullInterrupter | Dummy NOOP interrupter class defining interface
C OffMaskIterator |
C OnMaskIterator |
►C PagedArray | Concurrent, page-based, dynamically-sized linear data structure with O(1) random access and STL-compliant iterators. It is primarily intended for applications that concurrently insert (a possibly unkown number of) elements into a dynamically growing linear array, and fast random access to said elements
C ConstIterator |
C Iterator |
C Page |
C ValueBuffer |
►C RootNodeMask |
C BaseIterator |
C DenseIterator |
C OffIterator |
C OnIterator |
C ArithmeticError |
C CanConvertType | CanConvertType<FromType, ToType>::value is `true` if a value of type ToType can be constructed from a value of type FromType
C CanConvertType< math::Vec2< T >, math::Vec2< T > > |
C CanConvertType< math::Vec3< T >, math::Vec3< T > > |
C CanConvertType< math::Vec4< T >, math::Vec4< T > > |
C CanConvertType< PointDataIndex32, PointIndex32 > |
C CanConvertType< PointIndex32, PointDataIndex32 > |
C CanConvertType< T, math::Vec2< T > > |
C CanConvertType< T, math::Vec3< T > > |
C CanConvertType< T, math::Vec4< T > > |
C CanConvertType< T, ValueMask > |
C CanConvertType< T0, math::Vec2< T1 > > |
C CanConvertType< T0, math::Vec3< T1 > > |
C CanConvertType< T0, math::Vec4< T1 > > |
C CanConvertType< ValueMask, T > |
C CombineArgs | This struct collects both input and output arguments to "grid combiner" functors used with the tree::TypedGrid::combineExtended() and combine2Extended() methods. AValueType and BValueType are the value types of the two grids being combined
C CopyConstness | CopyConstness<T1, T2>::Type is either `const T2` or `T2` with no `const` qualifier, depending on whether `T1` is `const`
C Exception |
►C Grid | Container class that associates a tree with a transform and metadata
C ValueConverter | ValueConverter<T>::Type is the type of a grid having the same hierarchy as this grid but a different value type, T
C GridBase | Abstract base class for typed grids
C GridNamePred | Predicate functor that returns `true` for grids that have a specified name
C HasMultiPassIO | Metafunction that specifies whether a given leaf node, tree, or grid type requires multiple passes to read and write voxel data
C HasMultiPassIO< Grid< TreeType > > |
C HasMultiPassIO< tree::Tree< RootNodeType > > |
C IllegalValueException |
C IndexError |
C IoError |
C IsSpecializationOf | Helper metafunction used to determine if the first template parameter is a specialization of the class template given in the second template parameter
C IsSpecializationOf< Template< Args... >, Template > |
C KeyError |
C LookupError |
C MatTraits |
C MatTraits< T, false > |
C Metadata | Base class for storing metadata information in a grid
C MetaMap | Container that maps names (strings) to values of arbitrary types
C NotImplementedError |
C PartialCreate | Tag dispatch class that distinguishes constructors during file input
C PointIndex | Integer wrapper, required to distinguish PointIndexGrid and PointDataGrid from Int32Grid and Int64Grid
C QuatTraits |
C QuatTraits< T, false > |
C ReferenceError |
C RuntimeError |
C ShallowCopy | Tag dispatch class that distinguishes shallow copy constructors from deep copy constructors
C SwappedCombineOp |
C TopologyCopy | Tag dispatch class that distinguishes topology copy constructors from deep copy constructors
C TreeAdapter | This adapter allows code that is templated on a Tree type to accept either a Tree type or a Grid type
C TreeAdapter< Grid< _TreeType > > | Partial specialization for Grid types
C TreeAdapter< tree::ValueAccessor< _TreeType > > | Partial specialization for ValueAccessor types
C TypedMetadata | Templated metadata class to hold specific types
C TypeError |
C TypeList | A list of types (not necessarily unique)
C UnknownMetadata | Subclass to hold raw data of an unregistered type
C ValueError |
C ValueMask |
C ValueTraits |
C ValueTraits< T, false > |
C VecTraits |
C VecTraits< T, false > |
C VersionId |
▼N std |
C hash< openvdb::math::Coord > |
C FilterType | Selectively extract and filter point data using a custom filter operator
C MeshDataAdapter | Convert polygonal meshes that consist of quads and/or triangles into signed or unsigned distance field volumes
C ParticleArray | Partition particles and performs range and nearest-neighbor searches
C PointArray |
C PointArray | Partitions points into `BucketLog2Dim` aligned buckets using a parallel radix-based sorting algorithm
C TestLeafIO |