52 #ifndef OPENVDB_TOOLS_MULTIRESGRID_HAS_BEEN_INCLUDED 53 #define OPENVDB_TOOLS_MULTIRESGRID_HAS_BEEN_INCLUDED 69 #include <tbb/blocked_range.h> 70 #include <tbb/enumerable_thread_specific.h> 71 #include <tbb/parallel_for.h> 84 template<
typename TreeType>
146 TreeType& tree(
size_t level);
151 const TreeType& constTree(
size_t level)
const;
156 TreePtr treePtr(
size_t level);
161 ConstTreePtr constTreePtr(
size_t level)
const;
192 GridPtr grid(
size_t level);
197 ConstGridPtr grid(
size_t level)
const;
206 template<Index Order>
207 GridPtr
createGrid(
float level,
size_t grainSize = 1)
const;
235 static Vec3R xyz(
const Coord& in_ijk,
size_t in_level,
size_t out_level);
238 static Vec3R xyz(
const Vec3R& in_xyz,
size_t in_level,
size_t out_level);
239 static Vec3R xyz(
const Vec3R& in_xyz,
double in_level,
double out_level);
247 template<Index Order>
257 ValueType sampleValue(
const Coord& in_ijk,
size_t in_level,
size_t out_level)
const;
258 template<Index Order>
259 ValueType sampleValue(
const Vec3R& in_ijk,
size_t in_level,
size_t out_level)
const;
268 template<Index Order>
269 ValueType sampleValue(
const Coord& ijk,
double level)
const;
278 template<Index Order>
279 ValueType sampleValue(
const Vec3R& xyz,
double level)
const;
289 ValueType prolongateVoxel(
const Coord& coords,
const size_t level)
const;
295 void prolongateActiveVoxels(
size_t destlevel,
size_t grainSize = 1);
303 ValueType restrictVoxel(
Coord ijk,
const size_t level,
bool useInjection =
false)
const;
311 void restrictActiveVoxels(
size_t destlevel,
size_t grainSize = 1);
314 void print(std::ostream& = std::cout,
int verboseLevel = 1)
const;
356 void topDownRestrict(
bool useInjection);
358 inline void initMeta();
371 template<Index Order>
375 template<
typename OpType>
struct CookOp;
378 std::vector<TreePtr> mTrees;
383 template<
typename TreeType>
384 MultiResGrid<TreeType>::
385 MultiResGrid(
size_t levels,
ValueType background,
double voxelSize)
387 , mTransform(math::Transform::createLinearTransform( voxelSize ))
390 for (
size_t i=0; i<levels; ++i) mTrees[i] =
TreePtr(
new TreeType(background));
393 template<
typename TreeType>
398 , mTransform( grid.transform().copy() )
401 mTrees[0].reset(
new TreeType(
grid.tree() ) );
402 mTrees[0]->voxelizeActiveTiles();
403 this->topDownRestrict(useInjection);
406 template<
typename TreeType>
411 , mTransform( grid->transform().copy() )
414 mTrees[0] =
grid->treePtr();
415 mTrees[0]->voxelizeActiveTiles();
417 this->topDownRestrict(useInjection);
420 template<
typename TreeType>
424 assert( level < mTrees.size() );
425 return *mTrees[level];
428 template<
typename TreeType>
432 assert( level < mTrees.size() );
433 return *mTrees[level];
436 template<
typename TreeType>
440 assert( level < mTrees.size() );
441 return mTrees[level];
444 template<
typename TreeType>
448 assert( level < mTrees.size() );
449 return mTrees[level];
452 template<
typename TreeType>
458 if (level>0) xform->preScale(
Real(1 << level) );
462 std::stringstream ss;
463 ss << this->getName() <<
"_level_" << level;
468 template<
typename TreeType>
472 return const_cast<MultiResGrid*>(
this)->grid(level);
475 template<
typename TreeType>
476 template<Index Order>
480 assert( level >= 0.0f && level <=
float(mTrees.size()-1) );
484 xform->preScale(
math::Pow(2.0f, level) );
488 std::stringstream ss;
489 ss << this->getName() <<
"_level_" << level;
492 if (
size_t(floorf(level)) == size_t(ceilf(level)) ) {
493 grid->
setTree( this->constTree(
size_t(floorf(level))).copy() );
495 FractionOp<Order> tmp(*
this, grid->
tree(), level, grainSize);
505 template<
typename TreeType>
510 for (
size_t level=0; level<mTrees.size(); ++level) grids->push_back(this->grid(level));
514 template<
typename TreeType>
519 for (
size_t level=0; level<mTrees.size(); ++level) grids->push_back(this->grid(level));
523 template<
typename TreeType>
525 xyz(
const Coord& in_ijk,
size_t in_level,
size_t out_level)
530 template<
typename TreeType>
532 xyz(
const Vec3R& in_xyz,
size_t in_level,
size_t out_level)
534 return in_xyz *
Real(1 << in_level) /
Real(1 << out_level);
537 template<
typename TreeType>
539 xyz(
const Vec3R& in_xyz,
double in_level,
double out_level)
541 return in_xyz *
math::Pow(2.0, in_level - out_level);
545 template<
typename TreeType>
546 template<Index Order>
550 assert( in_level >= 0 && in_level < mTrees.size() );
551 assert( out_level >= 0 && out_level < mTrees.size() );
556 template<
typename TreeType>
557 template<Index Order>
561 assert( in_level >= 0 && in_level < mTrees.size() );
562 assert( out_level >= 0 && out_level < mTrees.size() );
567 template<
typename TreeType>
568 template<Index Order>
572 assert( level >= 0.0 && level <=
double(mTrees.size()-1) );
573 const size_t level0 = size_t(floor(level)), level1 = size_t(ceil(level));
574 const ValueType v0 = this->
template sampleValue<Order>( ijk, 0, level0 );
575 if ( level0 == level1 )
return v0;
576 assert( level1 - level0 == 1 );
577 const ValueType v1 = this->
template sampleValue<Order>( ijk, 0, level1 );
582 template<
typename TreeType>
583 template<Index Order>
587 assert( level >= 0.0 && level <=
double(mTrees.size()-1) );
588 const size_t level0 = size_t(floor(level)), level1 = size_t(ceil(level));
589 const ValueType v0 = this->
template sampleValue<Order>( xyz, 0, level0 );
590 if ( level0 == level1 )
return v0;
591 assert( level1 - level0 == 1 );
592 const ValueType v1 = this->
template sampleValue<Order>( xyz, 0, level1 );
597 template<
typename TreeType>
601 assert( level+1 < mTrees.size() );
603 return ProlongateOp::run(ijk, acc);
606 template<
typename TreeType>
610 assert( destlevel < mTrees.size()-1 );
611 TreeType &fineTree = *mTrees[ destlevel ];
612 const TreeType &coarseTree = *mTrees[ destlevel+1 ];
613 CookOp<ProlongateOp> tmp( coarseTree, fineTree, grainSize );
616 template<
typename TreeType>
620 assert( destlevel > 0 && destlevel < mTrees.size() );
621 const TreeType &fineTree = *mTrees[ destlevel-1 ];
622 if ( useInjection )
return fineTree.getValue(ijk<<1);
624 return RestrictOp::run( ijk, acc);
627 template<
typename TreeType>
631 assert( destlevel > 0 && destlevel < mTrees.size() );
632 const TreeType &fineTree = *mTrees[ destlevel-1 ];
633 TreeType &coarseTree = *mTrees[ destlevel ];
634 CookOp<RestrictOp> tmp( fineTree, coarseTree, grainSize );
637 template<
typename TreeType>
639 print(std::ostream& os,
int verboseLevel)
const 641 os <<
"MultiResGrid with " << mTrees.size() <<
" levels\n";
642 for (
size_t i=0; i<mTrees.size(); ++i) {
643 os <<
"Level " << i <<
": ";
644 mTrees[i]->print(os, verboseLevel);
648 os <<
"Additional metadata:" << std::endl;
650 os <<
" " << it->first;
652 const std::string value = it->second->str();
653 if (!value.empty()) os <<
": " << value;
659 os <<
"Transform:" << std::endl;
660 transform().print(os,
" ");
664 template<
typename TreeType>
668 const size_t levels = this->numLevels();
672 this->insertMeta(
"MultiResGrid_Levels",
Int64Metadata( levels ) );
675 template<
typename TreeType>
676 void MultiResGrid<TreeType>::
677 topDownRestrict(
bool useInjection)
680 for (
size_t n=1; n<mTrees.size(); ++n) {
681 const TreeType &fineTree = *mTrees[n-1];
682 mTrees[n] = TreePtr(
new TreeType( fineTree.background() ) );
683 TreeType &coarseTree = *mTrees[n];
685 for (ValueOnCIter it = fineTree.cbeginValueOn(); it; ++it) {
686 const Coord ijk = it.getCoord();
687 if ( (ijk[0] & 1) || (ijk[1] & 1) || (ijk[2] & 1) )
continue;
688 coarseTree.setValue( ijk >> 1, *it );
691 MaskOp tmp(fineTree, coarseTree, 128);
692 this->restrictActiveVoxels(n, 64);
701 template<
typename TreeType>
704 using MaskT =
typename TreeType::template ValueConverter<ValueMask>::Type;
705 using PoolType = tbb::enumerable_thread_specific<TreeType>;
708 using VoxelIterT =
typename ManagerT::LeafNodeType::ValueOnCIter;
710 MaskOp(
const TreeType& fineTree, TreeType& coarseTree,
size_t grainSize = 1)
711 : mPool(new
PoolType( coarseTree ) )
713 assert( coarseTree.empty() );
723 tbb::parallel_for(leafs.
leafRange( grainSize ), *
this);
726 using IterT =
typename PoolType::const_iterator;
727 for (IterT it=mPool->begin(); it!=mPool->end(); ++it) coarseTree.topologyUnion( *it );
732 Accessor coarseAcc( mPool->local() );
733 for (
typename RangeT::Iterator leafIter = range.begin(); leafIter; ++leafIter) {
734 for (
VoxelIterT voxelIter = leafIter->cbeginValueOn(); voxelIter; ++voxelIter) {
735 Coord ijk = voxelIter.getCoord();
736 if ( (ijk[2] & 1) || (ijk[1] & 1) || (ijk[0] & 1) )
continue;
737 coarseAcc.setValueOn( ijk >> 1 );
744 template<
typename TreeType>
745 template<Index Order>
748 using MaskT =
typename TreeType::template ValueConverter<ValueMask>::Type;
749 using PoolType = tbb::enumerable_thread_specific<MaskT>;
750 using PoolIterT =
typename PoolType::iterator;
753 using Range1 =
typename Manager1::LeafRange;
754 using Range2 =
typename Manager2::LeafRange;
759 size_t grainSize = 1)
762 , mTree0( &*(parent.mTrees[
size_t(floorf(level))]) )
763 , mTree1( &*(parent.mTrees[
size_t(ceilf(level))]) )
765 assert( midTree.empty() );
766 assert( mTree0 != mTree1 );
769 MaskT examplar(
false );
770 mPool =
new PoolType( examplar );
774 tbb::parallel_for( manager.
leafRange(grainSize), *this );
778 tbb::parallel_for(tbb::blocked_range<PoolIterT>(mPool->begin(),mPool->end(),1), *
this);
781 for (PoolIterT it=mPool->begin(); it!=mPool->end(); ++it) midTree.topologyUnion( *it );
785 Manager2 manager( midTree );
786 tbb::parallel_for(manager.leafRange(grainSize), *
this);
789 void operator()(
const Range1& range)
const 791 using VoxelIter =
typename Manager1::LeafNodeType::ValueOnCIter;
802 for (
typename Range1::Iterator leafIter = range.begin(); leafIter; ++leafIter) {
803 for (VoxelIter voxelIter = leafIter->cbeginValueOn(); voxelIter; ++voxelIter) {
804 Coord ijk = voxelIter.getCoord();
808 acc.setValueOn( ijk );
812 void operator()(
const tbb::blocked_range<PoolIterT>& range)
const 814 for (PoolIterT it=range.begin(); it!=range.end(); ++it) {
818 void operator()(
const Range2 &r)
const 820 using VoxelIter =
typename TreeType::LeafNodeType::ValueOnIter;
834 const float scale0 =
math::Pow( 2.0f, b );
835 const float scale1 =
math::Pow( 2.0f,-a );
836 ConstAccessor acc0( *mTree0 ), acc1( *mTree1 );
837 for (
typename Range2::Iterator leafIter = r.begin(); leafIter; ++leafIter) {
838 for (VoxelIter voxelIter = leafIter->beginValueOn(); voxelIter; ++voxelIter) {
839 const Vec3R xyz =
Vec3R( voxelIter.getCoord().data() );
842 voxelIter.setValue( ValueType(a*v0 + b*v1) );
848 const TreeType *mTree0, *mTree1;
852 template<
typename TreeType>
853 template<
typename OperatorType>
854 struct MultiResGrid<TreeType>::CookOp
856 using ManagerT = tree::LeafManager<TreeType>;
857 using RangeT =
typename ManagerT::LeafRange;
859 CookOp(
const TreeType& srcTree, TreeType& dstTree,
size_t grainSize): acc(srcTree)
861 ManagerT leafs(dstTree);
862 tbb::parallel_for(leafs.leafRange(grainSize), *
this);
864 CookOp(
const CookOp &other): acc(other.acc.tree()) {}
866 void operator()(
const RangeT& range)
const 868 for (
auto leafIt = range.begin(); leafIt; ++leafIt) {
869 auto& phi = leafIt.buffer(0);
870 for (
auto voxelIt = leafIt->beginValueOn(); voxelIt; ++voxelIt) {
871 phi.setValue(voxelIt.pos(), OperatorType::run(voxelIt.getCoord(), acc));
876 const ConstAccessor acc;
880 template<
typename TreeType>
903 for (
int i=-1; i<=1; i+=2) {
904 for (
int j=-1; j<=1; j+=2) {
913 template<
typename TreeType>
921 switch ( (ijk[0] & 1) | ((ijk[1] & 1) << 1) | ((ijk[2] & 1) << 2) ) {
951 for (
int i=-1; i<=1; i+=2) {
952 for (
int j=-1; j<=1; j+=2) {
964 #endif // OPENVDB_TOOLS_MULTIRESGRID_HAS_BEEN_INCLUDED std::vector< GridBase::ConstPtr > GridCPtrVec
Definition: Grid.h:442
math::Vec3< Real > Vec3R
Definition: Types.h:79
float Round(float x)
Return x rounded to the nearest integer.
Definition: Math.h:773
SharedPtr< Grid > Ptr
Definition: Grid.h:502
TypedMetadata< std::string > StringMetadata
Definition: Metadata.h:413
General-purpose arithmetic and comparison routines, most of which accept arbitrary value types (or at...
GridType::Ptr createGrid(const typename GridType::ValueType &background)
Create a new grid of type GridType with a given background value.
Definition: Grid.h:1582
GridClass getGridClass() const
Return the class of volumetric data (level set, fog volume, etc.) stored in this grid.
#define OPENVDB_THROW(exception, message)
Definition: Exceptions.h:109
NodeManager produces linear arrays of all tree nodes allowing for efficient threading and bottom-up p...
Tag dispatch class that distinguishes topology copy constructors from deep copy constructors.
Definition: Types.h:518
Signed (x, y, z) 32-bit integer coordinates.
Definition: Coord.h:51
Container class that associates a tree with a transform and metadata.
Definition: Grid.h:55
static Ptr create()
Return a new grid with background value zero.
Definition: Grid.h:1187
Defined various multi-threaded utility functions for trees.
OPENVDB_API uint32_t getGridClass(std::ios_base &)
Return the class (GRID_LEVEL_SET, GRID_UNKNOWN, etc.) of the grid currently being read from or writte...
void setName(const std::string &)
Specify a name for this grid.
GridClass
Definition: Types.h:275
static GridClass stringToGridClass(const std::string &)
Return the class of volumetric data specified by the given string.
const Int32 * data() const
Definition: Coord.h:166
#define OPENVDB_VERSION_NAME
The version namespace name for this library version.
Definition: version.h:136
Definition: LeafManager.h:127
TreeType & tree()
Return a reference to this grid's tree, which might be shared with other grids.
Definition: Grid.h:798
void setTree(TreeBase::Ptr) override
Associate the given tree with this grid, in place of its existing tree.
Definition: Grid.h:1310
Propagate the signs of distance values from the active voxels in the narrow band to the inactive valu...
const ValueType & getValue(const Coord &xyz) const
Return the value of the voxel at the given coordinates.
Definition: ValueAccessor.h:257
Implementation of morphological dilation and erosion.
SharedPtr< const Grid > ConstPtr
Definition: Grid.h:503
Definition: Exceptions.h:40
Type FractionalPart(Type x)
Return the fractional part of x.
Definition: Math.h:797
TypedMetadata< int64_t > Int64Metadata
Definition: Metadata.h:412
void setTransform(math::Transform::Ptr)
Associate the given transform with this grid, in place of its existing transform.
Definition: Grid.h:1113
SharedPtr< GridCPtrVec > GridCPtrVecPtr
Definition: Grid.h:445
This class manages a linear array of pointers to a given tree's leaf nodes, as well as optional auxil...
Definition: LeafManager.h:110
static const char *const META_GRID_CLASS
Definition: Grid.h:291
MatType scale(const Vec3< typename MatType::value_type > &s)
Return a matrix that scales by s.
Definition: Mat.h:647
Definition: ValueAccessor.h:220
TypedMetadata< float > FloatMetadata
Definition: Metadata.h:410
std::shared_ptr< T > SharedPtr
Definition: Types.h:139
static const char *const META_GRID_NAME
Definition: Grid.h:293
Type Pow(Type x, int n)
Return xn.
Definition: Math.h:515
LeafRange leafRange(size_t grainsize=1) const
Return a TBB-compatible LeafRange.
Definition: LeafManager.h:386
Defines various finite difference stencils by means of the "curiously recurring template pattern" on ...
std::vector< GridBase::Ptr > GridPtrVec
Definition: Grid.h:437
Definition: Exceptions.h:92
#define OPENVDB_USE_VERSION_NAMESPACE
Definition: version.h:188
A LeafManager manages a linear array of pointers to a given tree's leaf nodes, as well as optional au...
SharedPtr< GridPtrVec > GridPtrVecPtr
Definition: Grid.h:440
static std::string gridClassToString(GridClass)
Return the metadata string value for the given class of volumetric data.
double Real
Definition: Types.h:67
Coord offsetBy(Int32 dx, Int32 dy, Int32 dz) const
Definition: Coord.h:118