OpenVDB  6.1.0
File List
Here is a list of all files with brief descriptions:
 AttributeArray.hAttribute Array storage templated on type and compression codec
 AttributeArrayString.hAttribute array storage for string data using Descriptor Metadata
 AttributeGroup.hAttribute Group access and filtering for iteration
 AttributeSet.hSet of Attribute Arrays which tracks metadata about each array
 ChangeBackground.hEfficient multi-threaded replacement of the background values in tree
 Clip.hFunctions to clip a grid against a bounding box, a camera frustum, or another grid's active voxel topology
 Composite.hFunctions to efficiently perform various compositing operations on grids
 ConjGradient.hPreconditioned conjugate gradient solver (solves Ax = b using the conjugate gradient method with one of a selection of preconditioners)
 DDA.hDigital Differential Analyzers specialized for VDB
 Dense.hThis file defines a simple dense grid and efficient converters to and from VDB grids
 Diagnostics.hVarious diagnostic tools to identify potential issues with for example narrow-band level sets or fog volumes
 Filter.hFiltering of VDB volumes. Note that only the values in the grid are changed, not its topology! All operations can optionally be masked with another grid that acts as an alpha-mask
 Formats.hUtility routines to output nicely-formatted numeric values
 GridOperators.hApply an operator to an input grid to produce an output grid with the same active voxel topology but a potentially different value type
 IndexFilter.hIndex filters primarily designed to be used with a FilterIndexIter
 IndexIterator.hIndex Iterators
 InternalNode.hInternal table nodes for OpenVDB trees
 LeafManager.hA LeafManager 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
 LevelSetAdvect.hHyperbolic advection of narrow-band level sets
 LevelSetFilter.hPerforms various types of level set deformations with interface tracking. These unrestricted deformations include surface smoothing (e.g., Laplacian flow), filtering (e.g., mean value) and morphological operations (e.g., morphological opening). All these operations can optionally be masked with another grid that acts as an alpha-mask
 LevelSetFracture.hDivide volumes represented by level set grids into multiple, disjoint pieces by intersecting them with one or more "cutter" volumes, also represented by level sets
 LevelSetMorph.hShape morphology of level sets. Morphing from a source narrow-band level sets to a target narrow-band level set
 LevelSetPlatonic.hGenerate a narrow-band level sets of the five platonic solids
 LevelSetSphere.hGenerate a narrow-band level set of sphere
 LevelSetTracker.hPerforms multi-threaded interface tracking of narrow band level sets. This is the building-block for most level set computations that involve dynamic topology, e.g. advection
 LevelSetUtil.hMiscellaneous utility methods that operate primarily or exclusively on level set grids
 Mask.hConstruct boolean mask grids from grids of arbitrary type
 Math.hGeneral-purpose arithmetic and comparison routines, most of which accept arbitrary value types (or at least arbitrary numeric value types)
 MeshToVolume.hConvert polygonal meshes that consist of quads and/or triangles into signed or unsigned distance field volumes
 Morphology.hImplementation of morphological dilation and erosion
 MultiResGrid.hMulti-resolution grid that contains LoD sequences of trees with powers of two refinements
 NodeManager.hNodeManager produces linear arrays of all tree nodes allowing for efficient threading and bottom-up processing
 PagedArray.hConcurrent, page-based, dynamically-sized linear data structure with O(1) random access and STL-compliant iterators. It is primarily intended for applications that involve multi-threading push_back of (a possibly unkown number of) elements into a dynamically growing linear array, and fast random access to said elements
 ParticleAtlas.hSpace-partitioning acceleration structure for particles, points with radius. Partitions particle indices into voxels to accelerate range and nearest neighbor searches
 ParticlesToLevelSet.hRasterize particles with position, radius and velocity into either a boolean mask grid or a narrow-band level set grid
 points/PointAdvect.hAbility to advect VDB Points through a velocity field
 tools/PointAdvect.hClass PointAdvect advects points (with position) in a static velocity field
 PointAttribute.hPoint attribute manipulation in a VDB Point Grid
 PointConversion.hConvert points and attributes to and from VDB Point Data grids
 PointCount.hMethods for counting points in VDB Point grids
 PointDataGrid.hAttribute-owned data structure for points. Point attributes are stored in leaf nodes and ordered by voxel for fast random and sequential access
 PointDelete.hMethods for deleting points based on group membership
 PointGroup.hPoint group manipulation in a VDB Point Grid
 PointIndexGrid.hSpace-partitioning acceleration structure for points. Partitions the points into voxels to accelerate range and nearest neighbor searches
 PointMask.hMethods for extracting masks from VDB Point grids
 PointMove.hAbility to move VDB Points using a custom deformer
 PointPartitioner.hSpatially partitions points using a parallel radix-based sorting algorithm
 PointSample.hSample a VDB Grid onto a VDB Points attribute
 points/PointScatter.hVarious point scattering methods for generating VDB Points
 tools/PointScatter.hWe offer three different algorithms (each in its own class) for scattering of points in active voxels:
 PointsToMask.hThis tool produces a grid where every voxel that contains a point is active. It employes thread-local storage for best performance
 PoissonSolver.hSolve Poisson's equation ∇2x = b for x, where b is a vector comprising the values of all of the active voxels in a grid
 PotentialFlow.hTools for creating potential flow fields through solving Laplace's equation
 Prune.hDefined various multi-threaded utility functions for trees
 pyopenvdb.hGlue functions for access to pyOpenVDB objects from C++ code
 Ray.hA Ray class
 RayIntersector.hAccelerated intersection of a ray with a narrow-band level set or a generic (e.g. density) volume. This will of course be useful for respectively surface and volume rendering
 RayTracer.hDefines two simple but multithreaded renders, a level-set ray tracer and a volume render. To support these renders we also define perspective and orthographic cameras (both designed to mimic a Houdini camera), a Film class and some rather naive shaders
 RootNode.hThe root node of an OpenVDB tree
 SignedFloodFill.hPropagate the signs of distance values from the active voxels in the narrow band to the inactive values outside the narrow band
 Statistics.hFunctions to efficiently compute histograms, extremas (min/max) and statistics (mean, variance, etc.) of grid values
 Stats.hClasses to compute statistics and histograms
 Stencils.hDefines various finite difference stencils by means of the "curiously recurring template pattern" on a BaseStencil that caches stencil values and stores a ValueAccessor for fast lookup
 StreamCompression.hConvenience wrappers to using Blosc and reading and writing of Paged data
 TopologyToLevelSet.hThis tool generates a narrow-band signed distance field / level set from the interface between active and inactive voxels in a vdb grid
 VelocityFields.hDefines two simple wrapper classes for advection velocity fields as well as VelocitySampler and VelocityIntegrator
 version.hLibrary and file format version numbers
 VolumeAdvect.hSparse hyperbolic advection of volumes, e.g. a density or velocity (vs a level set interface)
 VolumeToMesh.hExtract polygonal surfaces from scalar volumes
 VolumeToSpheres.hFill a closed level set or fog volume with adaptively-sized spheres