OpenVDB
0.104.0
|
#include <iostream>
#include <algorithm>
#include <cstring>
#include <boost/shared_ptr.hpp>
#include <boost/static_assert.hpp>
#include <boost/bind.hpp>
#include <tbb/blocked_range.h>
#include <tbb/parallel_for.h>
#include <openvdb/tools/Morphology.h>
#include <openvdb/tree/LeafManager.h>
Go to the source code of this file.
Classes | |
class | TestLeafIO< typename > |
class | 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. More... | |
struct | LeafArray< TreeT, BufferCount >::BufferStruct |
Simple structure of LeafNode pointers and corresponding write buffers. More... | |
class | LeafArray< TreeT, 0 > |
This template specialization of LeafArray contains no write buffers! Hence this is effectively a thin wrapper for std::vector<LeafNode*> More... | |
struct | LeafArray< TreeT, 0 >::BufferStruct |
Simple structure of LeafNode pointers and corresponding write buffers. More... | |
Namespaces | |
namespace | openvdb |
namespace | openvdb::v0_104_0 |
namespace | openvdb::v0_104_0::tree |
Functions | |
template<typename TreeType , int BufferCount> | |
void OPENVDB_DEPRECATED | dilateVoxels (tree::LeafArray< TreeType, BufferCount > &leafArray) |