9 #ifndef OPENVDB_TOOLS_DENSE_HAS_BEEN_INCLUDED
10 #define OPENVDB_TOOLS_DENSE_HAS_BEEN_INCLUDED
18 #include <tbb/parallel_for.h>
35 template<
typename DenseT,
typename Gr
idOrTreeT>
38 const GridOrTreeT& sparse,
49 template<
typename DenseT,
typename Gr
idOrTreeT>
73 template<
typename ValueT, MemoryLayout Layout>
class DenseBase;
78 template<
typename ValueT>
88 inline size_t coordToOffset(
size_t i,
size_t j,
size_t k)
const {
return i*mX + j*mY + k; }
96 const size_t x = n / mX;
98 const size_t y = n / mY;
125 template<
typename ValueT>
135 inline size_t coordToOffset(
size_t i,
size_t j,
size_t k)
const {
return i + j*mY + k*mZ; }
143 const size_t z = n / mZ;
145 const size_t y = n / mY;
181 template<
typename ValueT, MemoryLayout Layout = LayoutZYX>
220 if (BaseT::mBBox.empty()) {
221 OPENVDB_THROW(ValueError,
"can't construct a dense grid with an empty bounding box");
232 Dense(
const Coord& dim,
const Coord&
min = Coord(0))
243 inline ValueT*
data() {
return mData; }
247 inline const ValueT*
data()
const {
return mData; }
254 inline const Coord&
origin()
const {
return BaseT::mBBox.min(); }
272 mData[BaseT::coordToOffset(i,j,k)] =
value;
278 inline const ValueT&
getValue(
size_t i,
size_t j,
size_t k)
const
280 return mData[BaseT::coordToOffset(i,j,k)];
288 return mData[BaseT::coordToOffset(i,j,k)];
300 inline const ValueT&
getValue(
const Coord& xyz)
const
318 while(size--) *a++ =
value;
329 assert(BaseT::mBBox.isInside(xyz));
330 return BaseT::coordToOffset(
size_t(xyz[0]-BaseT::mBBox.
min()[0]),
331 size_t(xyz[1]-BaseT::mBBox.
min()[1]),
332 size_t(xyz[2]-BaseT::mBBox.
min()[2]));
338 return this->offsetToLocalCoord(n) + BaseT::mBBox.min();
344 return sizeof(*this) + BaseT::mBBox.volume() *
sizeof(
ValueType);
351 const Coord dim = BaseT::mBBox.dim();
353 if (!
name.empty()) os <<
" \"" <<
name <<
"\"";
355 os <<
" Dimensions of grid : " << dim[0] <<
" x " << dim[1] <<
" x " << dim[2] <<
"\n";
357 os <<
" Bounding box of voxels: " << BaseT::mBBox <<
"\n";
358 os <<
" Memory layout: " << (Layout ==
LayoutZYX ?
"ZYX (" :
"XYZ (dis")
359 <<
"similar to VDB)\n";
366 if (BaseT::mBBox.empty()) {
367 OPENVDB_THROW(ValueError,
"can't construct a dense grid with an empty bounding box");
369 mArray.reset(
new ValueT[BaseT::mBBox.volume()]);
370 mData = mArray.get();
373 std::unique_ptr<ValueT[]> mArray;
386 template<
typename _TreeT,
typename _DenseT = Dense<
typename _TreeT::ValueType> >
395 : mRoot(&(tree.root())), mDense(&dense) {}
397 void copy(
bool serial =
false)
const
400 mRoot->copyToDense(mDense->bbox(), *mDense);
409 mRoot->copyToDense(bbox, *mDense);
413 const typename TreeT::RootNodeType* mRoot;
419 template<
typename DenseT,
typename Gr
idOrTreeT>
421 copyToDense(
const GridOrTreeT& sparse, DenseT& dense,
bool serial)
424 using TreeT =
typename Adapter::TreeType;
443 template<
typename _TreeT,
typename _DenseT = Dense<
typename _TreeT::ValueType> >
450 using LeafT =
typename TreeT::LeafNodeType;
457 mTolerance(tolerance),
458 mAccessor(tree.empty() ? nullptr : new
AccessorT(tree))
462 : mDense(other.mDense),
464 mBlocks(other.mBlocks),
465 mTolerance(other.mTolerance),
466 mAccessor(other.mAccessor.
get() == nullptr ? nullptr : new
AccessorT(*mTree))
473 mBlocks =
new std::vector<Block>();
477 for (
sub.min()[1] = bbox.min()[1];
sub.min()[1] <= bbox.max()[1];
478 sub.min()[1] =
sub.max()[1] + 1)
480 for (
sub.min()[2] = bbox.min()[2];
sub.min()[2] <= bbox.max()[2];
481 sub.min()[2] =
sub.max()[2] + 1)
484 (
sub.min()&(~(LeafT::DIM-1u))).offsetBy(LeafT::DIM-1u));
485 mBlocks->push_back(Block(
sub));
492 (*this)(tbb::blocked_range<size_t>(0, mBlocks->size()));
499 for (
size_t m=0,
size = mBlocks->size(); m<
size; ++m) {
500 Block& block = (*mBlocks)[m];
503 }
else if (block.tile.second) {
504 acc.
addTile(1, block.bbox.min(), block.tile.first,
true);
520 for (
size_t m=r.begin(),
n=0,
end = r.end(); m !=
end; ++m, ++
n) {
522 Block& block = (*mBlocks)[m];
525 if (mAccessor.get() ==
nullptr) {
526 leaf->fill(mTree->background(),
false);
528 if (
const LeafT*
target = mAccessor->probeConstLeaf(bbox.min())) {
532 bool state = mAccessor->probeValue(bbox.min(),
value);
533 leaf->fill(value, state);
537 leaf->copyFromDense(bbox, *mDense, mTree->background(), mTolerance);
539 if (!leaf->isConstant(block.tile.first, block.tile.second, mTolerance)) {
540 leaf->setOrigin(bbox.min() & (~(LeafT::DIM - 1)));
553 std::pair<ValueT, bool> tile;
554 Block(
const CoordBBox&
b) : bbox(b), leaf(nullptr) {}
559 std::vector<Block>* mBlocks;
561 std::unique_ptr<AccessorT> mAccessor;
566 template<
typename DenseT,
typename Gr
idOrTreeT>
572 using TreeT =
typename Adapter::TreeType;
582 #endif // OPENVDB_TOOLS_DENSE_HAS_BEEN_INCLUDED
Vec2< T > minComponent(const Vec2< T > &v1, const Vec2< T > &v2)
Return component-wise minimum of the two vectors.
void parallel_for(int64_t start, int64_t end, std::function< void(int64_t index)> &&task, parallel_options opt=parallel_options(0, Split_Y, 1))
GLsizei const GLchar *const * string
GLsizei const GLfloat * value
GLdouble GLdouble GLdouble z
GLboolean GLboolean GLboolean GLboolean a
#define OPENVDB_USE_VERSION_NAMESPACE
ImageBuf OIIO_API min(Image_or_Const A, Image_or_Const B, ROI roi={}, int nthreads=0)
The Value Accessor Implementation and API methods. The majoirty of the API matches the API of a compa...
This adapter allows code that is templated on a Tree type to accept either a Tree type or a Grid type...
std::shared_ptr< T > SharedPtr
ImageBuf OIIO_API sub(Image_or_Const A, Image_or_Const B, ROI roi={}, int nthreads=0)
ValueAccessors are designed to help accelerate accesses into the OpenVDB Tree structures by storing c...
Defined various multi-threaded utility functions for trees.
auto get(const UT_ARTIterator< T > &it) -> decltype(it.key())
GLuint const GLchar * name
GLboolean GLboolean GLboolean b
FormattedInt< IntT > formattedInt(IntT n)
OPENVDB_API int printBytes(std::ostream &os, uint64_t bytes, const std::string &head="", const std::string &tail="\n", bool exact=false, int width=8, int precision=3)
#define OPENVDB_VERSION_NAME
The version namespace name for this library version.
void addLeaf(LeafNodeT *leaf)
Add the specified leaf to this tree, possibly creating a child branch in the process. If the leaf node already exists, replace it.
void addTile(Index level, const Coord &xyz, const ValueType &value, bool state)
Add a tile at the specified tree level that contains the coordinate xyz, possibly deleting existing n...
#define OPENVDB_THROW(exception, message)