OpenVDB  3.1.0
LevelSetTracker.h
Go to the documentation of this file.
1 //
3 // Copyright (c) 2012-2015 DreamWorks Animation LLC
4 //
5 // All rights reserved. This software is distributed under the
6 // Mozilla Public License 2.0 ( http://www.mozilla.org/MPL/2.0/ )
7 //
8 // Redistributions of source code must retain the above copyright
9 // and license notice and the following restrictions and disclaimer.
10 //
11 // * Neither the name of DreamWorks Animation nor the names of
12 // its contributors may be used to endorse or promote products derived
13 // from this software without specific prior written permission.
14 //
15 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
16 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
17 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
18 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
19 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY INDIRECT, INCIDENTAL,
20 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
21 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
22 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
23 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
25 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 // IN NO EVENT SHALL THE COPYRIGHT HOLDERS' AND CONTRIBUTORS' AGGREGATE
27 // LIABILITY FOR ALL CLAIMS REGARDLESS OF THEIR BASIS EXCEED US$250.00.
28 //
30 //
38 
39 #ifndef OPENVDB_TOOLS_LEVEL_SET_TRACKER_HAS_BEEN_INCLUDED
40 #define OPENVDB_TOOLS_LEVEL_SET_TRACKER_HAS_BEEN_INCLUDED
41 
42 #include <tbb/parallel_for.h>
43 #include <boost/bind.hpp>
44 #include <boost/function.hpp>
45 #include <boost/type_traits/is_floating_point.hpp>
46 #include <openvdb/Types.h>
47 #include <openvdb/math/Math.h>
48 #include <openvdb/math/FiniteDifference.h>
49 #include <openvdb/math/Operators.h>
50 #include <openvdb/math/Stencils.h>
51 #include <openvdb/math/Transform.h>
52 #include <openvdb/Grid.h>
53 #include <openvdb/util/NullInterrupter.h>
54 #include <openvdb/tree/ValueAccessor.h>
55 #include <openvdb/tree/LeafManager.h>
56 #include "ChangeBackground.h"// for changeLevelSetBackground
57 #include "Morphology.h"//for dilateVoxels
58 #include "Prune.h"// for pruneLevelSet
59 
60 namespace openvdb {
62 namespace OPENVDB_VERSION_NAME {
63 namespace tools {
64 
66 template<typename GridT, typename InterruptT = util::NullInterrupter>
68 {
69 public:
70  typedef GridT GridType;
71  typedef typename GridT::TreeType TreeType;
72  typedef typename TreeType::LeafNodeType LeafType;
73  typedef typename TreeType::ValueType ValueType;
74  typedef typename tree::LeafManager<TreeType> LeafManagerType; // leafs + buffers
77  typedef typename TreeType::template ValueConverter<bool>::Type BoolMaskType;
78  BOOST_STATIC_ASSERT(boost::is_floating_point<ValueType>::value);
79 
81  struct State {
84  int n = static_cast<int>(LEVEL_SET_HALF_WIDTH), int g = 1)
85  : spatialScheme(s), temporalScheme(t), normCount(n), grainSize(g) {}
88  int normCount;// Number of iterations of normalization
89  int grainSize;
90  };
91 
94  LevelSetTracker(GridT& grid, InterruptT* interrupt = NULL);
95 
96  virtual ~LevelSetTracker() { delete mLeafs; }
97 
100  template <typename MaskType>
101  void normalize(const MaskType* mask);
102 
104  void normalize() { this->normalize<BoolMaskType>(NULL); }
105 
108  void track();
109 
111  void prune();
112 
128  void dilate(int iterations = 1);
129 
132  void erode(int iterations = 1);
133 
136  bool resize(Index halfWidth = static_cast<Index>(LEVEL_SET_HALF_WIDTH));
137 
139  ValueType getHalfWidth() const { return mGrid->background()/mDx; }
140 
142  State getState() const { return mState; }
143 
145  void setState(const State& s) { mState =s; }
146 
148  math::BiasedGradientScheme getSpatialScheme() const { return mState.spatialScheme; }
149 
151  void setSpatialScheme(math::BiasedGradientScheme scheme) { mState.spatialScheme = scheme; }
152 
154  math::TemporalIntegrationScheme getTemporalScheme() const { return mState.temporalScheme; }
155 
157  void setTemporalScheme(math::TemporalIntegrationScheme scheme) { mState.temporalScheme = scheme;}
158 
161  int getNormCount() const { return mState.normCount; }
162 
165  void setNormCount(int n) { mState.normCount = n; }
166 
168  int getGrainSize() const { return mState.grainSize; }
169 
172  void setGrainSize(int grainsize) { mState.grainSize = grainsize; }
173 
174  ValueType voxelSize() const { return mDx; }
175 
176  void startInterrupter(const char* msg);
177 
178  void endInterrupter();
179 
181  bool checkInterrupter();
182 
183  const GridType& grid() const { return *mGrid; }
184 
185  LeafManagerType& leafs() { return *mLeafs; }
186 
187  const LeafManagerType& leafs() const { return *mLeafs; }
188 
189 private:
190 
191  // disallow copy construction and copy by assignment!
192  LevelSetTracker(const LevelSetTracker&);// not implemented
193  LevelSetTracker& operator=(const LevelSetTracker&);// not implemented
194 
195  // Private class to perform multi-threaded trimming of
196  // voxels that are too far away from the zero-crossing.
197  struct Trim
198  {
199  Trim(LevelSetTracker& tracker) : mTracker(tracker) {}
200  void trim();
201  void operator()(const LeafRange& r) const;
202  LevelSetTracker& mTracker;
203  };// Trim
204 
205  // Private struct to perform multi-threaded normalization
206  template<math::BiasedGradientScheme SpatialScheme,
207  math::TemporalIntegrationScheme TemporalScheme,
208  typename MaskT>
209  struct Normalizer
210  {
211  typedef math::BIAS_SCHEME<SpatialScheme> SchemeT;
212  typedef typename SchemeT::template ISStencil<GridType>::StencilType StencilT;
213  typedef typename MaskT::LeafNodeType MaskLeafT;
214  typedef typename MaskLeafT::ValueOnCIter MaskIterT;
215  typedef typename LeafType::ValueOnCIter VoxelIterT;
216  Normalizer(LevelSetTracker& tracker, const MaskT* mask);
217  void normalize();
218  void operator()(const LeafRange& r) const {mTask(const_cast<Normalizer*>(this), r);}
219  void cook(int swapBuffer=0);
220  template <int Nominator, int Denominator>
221  void euler(const LeafRange& range, Index phiBuffer, Index resultBuffer);
222  inline void euler01(const LeafRange& r) {this->euler<0,1>(r, 0, 1);}
223  inline void euler12(const LeafRange& r) {this->euler<1,2>(r, 1, 1);}
224  inline void euler34(const LeafRange& r) {this->euler<3,4>(r, 1, 2);}
225  inline void euler13(const LeafRange& r) {this->euler<1,3>(r, 1, 2);}
226  template <int Nominator, int Denominator>
227  void eval(StencilT& stencil, const ValueType* phi, ValueType* result, Index n) const;
228  LevelSetTracker& mTracker;
229  const MaskT* mMask;
230  const ValueType mDt, mInvDx;
231  typename boost::function<void (Normalizer*, const LeafRange&)> mTask;
232  }; // Normalizer struct
233 
234  template<math::BiasedGradientScheme SpatialScheme, typename MaskT>
235  void normalize1(const MaskT* mask);
236 
237  template<math::BiasedGradientScheme SpatialScheme,
238  math::TemporalIntegrationScheme TemporalScheme, typename MaskT>
239  void normalize2(const MaskT* mask);
240 
241  // Throughout the methods below mLeafs is always assumed to contain
242  // a list of the current LeafNodes! The auxiliary buffers on the
243  // other hand always have to be allocated locally, since some
244  // methods need them and others don't!
245  GridType* mGrid;
246  LeafManagerType* mLeafs;
247  InterruptT* mInterrupter;
248  const ValueType mDx;
249  State mState;
250 }; // end of LevelSetTracker class
251 
252 template<typename GridT, typename InterruptT>
254 LevelSetTracker(GridT& grid, InterruptT* interrupt):
255  mGrid(&grid),
256  mLeafs(new LeafManagerType(grid.tree())),
257  mInterrupter(interrupt),
258  mDx(static_cast<ValueType>(grid.voxelSize()[0])),
259  mState()
260 {
261  if ( !grid.hasUniformVoxels() ) {
263  "The transform must have uniform scale for the LevelSetTracker to function");
264  }
265  if ( grid.getGridClass() != GRID_LEVEL_SET) {
267  "LevelSetTracker expected a level set, got a grid of class \""
268  + grid.gridClassToString(grid.getGridClass())
269  + "\" [hint: Grid::setGridClass(openvdb::GRID_LEVEL_SET)]");
270  }
271 }
272 
273 template<typename GridT, typename InterruptT>
274 inline void
277 {
278  this->startInterrupter("Pruning Level Set");
279 
280  // Prune voxels that are too far away from the zero-crossing
281  Trim t(*this);
282  t.trim();
283 
284  // Remove inactive nodes from tree
285  tools::pruneLevelSet(mGrid->tree());
286 
287  // The tree topology has changes so rebuild the list of leafs
288  mLeafs->rebuildLeafArray();
289  this->endInterrupter();
290 }
291 
292 template<typename GridT, typename InterruptT>
293 inline void
296 {
297  // Dilate narrow-band (this also rebuilds the leaf array!)
298  tools::dilateVoxels(*mLeafs);
299 
300  // Compute signed distances in dilated narrow-band
301  this->normalize();
302 
303  // Remove voxels that are outside the narrow band
304  this->prune();
305 }
306 
307 template<typename GridT, typename InterruptT>
308 inline void
310 dilate(int iterations)
311 {
312  if (this->getNormCount() == 0) {
313  for (int i=0; i < iterations; ++i) {
314  tools::dilateVoxels(*mLeafs);
315  mLeafs->rebuildLeafArray();
316  tools::changeLevelSetBackground(this->leafs(), mDx + mGrid->background());
317  }
318  } else {
319  for (int i=0; i < iterations; ++i) {
320  BoolMaskType mask0(mGrid->tree(), false, TopologyCopy());
321  tools::dilateVoxels(*mLeafs);
322  mLeafs->rebuildLeafArray();
323  tools::changeLevelSetBackground(this->leafs(), mDx + mGrid->background());
324  BoolMaskType mask(mGrid->tree(), false, TopologyCopy());
325  mask.topologyDifference(mask0);
326  this->normalize(&mask);
327  }
328  }
329 }
330 
331 template<typename GridT, typename InterruptT>
332 inline void
334 erode(int iterations)
335 {
336  tools::erodeVoxels(*mLeafs, iterations);
337  mLeafs->rebuildLeafArray();
338  const ValueType background = mGrid->background() - iterations*mDx;
339  tools::changeLevelSetBackground(this->leafs(), background);
340 }
341 
342 template<typename GridT, typename InterruptT>
343 inline bool
345 resize(Index halfWidth)
346 {
347  const int wOld = static_cast<int>(math::RoundDown(this->getHalfWidth()));
348  const int wNew = static_cast<int>(halfWidth);
349  if (wOld < wNew) {
350  this->dilate(wNew - wOld);
351  } else if (wOld > wNew) {
352  this->erode(wOld - wNew);
353  }
354  return wOld != wNew;
355 }
356 
357 template<typename GridT, typename InterruptT>
358 inline void
360 startInterrupter(const char* msg)
361 {
362  if (mInterrupter) mInterrupter->start(msg);
363 }
364 
365 template<typename GridT, typename InterruptT>
366 inline void
369 {
370  if (mInterrupter) mInterrupter->end();
371 }
372 
373 template<typename GridT, typename InterruptT>
374 inline bool
377 {
378  if (util::wasInterrupted(mInterrupter)) {
379  tbb::task::self().cancel_group_execution();
380  return false;
381  }
382  return true;
383 }
384 
385 template<typename GridT, typename InterruptT>
386 template<typename MaskT>
387 inline void
389 normalize(const MaskT* mask)
390 {
391  switch (this->getSpatialScheme()) {
392  case math::FIRST_BIAS:
393  this->normalize1<math::FIRST_BIAS , MaskT>(mask); break;
394  case math::SECOND_BIAS:
395  this->normalize1<math::SECOND_BIAS, MaskT>(mask); break;
396  case math::THIRD_BIAS:
397  this->normalize1<math::THIRD_BIAS, MaskT>(mask); break;
398  case math::WENO5_BIAS:
399  this->normalize1<math::WENO5_BIAS, MaskT>(mask); break;
400  case math::HJWENO5_BIAS:
401  this->normalize1<math::HJWENO5_BIAS, MaskT>(mask); break;
402  default:
403  OPENVDB_THROW(ValueError, "Spatial difference scheme not supported!");
404  }
405 }
406 
407 template<typename GridT, typename InterruptT>
408 template<math::BiasedGradientScheme SpatialScheme, typename MaskT>
409 inline void
411 normalize1(const MaskT* mask)
412 {
413  switch (this->getTemporalScheme()) {
414  case math::TVD_RK1:
415  this->normalize2<SpatialScheme, math::TVD_RK1, MaskT>(mask); break;
416  case math::TVD_RK2:
417  this->normalize2<SpatialScheme, math::TVD_RK2, MaskT>(mask); break;
418  case math::TVD_RK3:
419  this->normalize2<SpatialScheme, math::TVD_RK3, MaskT>(mask); break;
420  default:
421  OPENVDB_THROW(ValueError, "Temporal integration scheme not supported!");
422  }
423 }
424 
425 template<typename GridT, typename InterruptT>
426 template<math::BiasedGradientScheme SpatialScheme,
427  math::TemporalIntegrationScheme TemporalScheme,
428  typename MaskT>
429 inline void
431 normalize2(const MaskT* mask)
432 {
433  Normalizer<SpatialScheme, TemporalScheme, MaskT> tmp(*this, mask);
434  tmp.normalize();
435 }
436 
438 
439 template<typename GridT, typename InterruptT>
440 inline void
442 Trim::trim()
443 {
444  const int grainSize = mTracker.getGrainSize();
445  const LeafRange range = mTracker.leafs().leafRange(grainSize);
446 
447  if (grainSize>0) {
448  tbb::parallel_for(range, *this);
449  } else {
450  (*this)(range);
451  }
452 }
453 
455 template<typename GridT, typename InterruptT>
456 inline void
458 Trim::operator()(const LeafRange& range) const
459 {
460  typedef typename LeafType::ValueOnIter VoxelIterT;
461  mTracker.checkInterrupter();
462  const ValueType gamma = mTracker.mGrid->background();
463 
464  for (typename LeafRange::Iterator leafIter = range.begin(); leafIter; ++leafIter) {
465  LeafType &leaf = *leafIter;
466  for (VoxelIterT iter = leaf.beginValueOn(); iter; ++iter) {
467  const ValueType val = *iter;
468  if (val <= -gamma)
469  leaf.setValueOff(iter.pos(), -gamma);
470  else if (val >= gamma)
471  leaf.setValueOff(iter.pos(), gamma);
472  }
473  }
474 }
475 
477 
478 template<typename GridT, typename InterruptT>
479 template<math::BiasedGradientScheme SpatialScheme,
480  math::TemporalIntegrationScheme TemporalScheme,
481  typename MaskT>
482 inline
485 Normalizer(LevelSetTracker& tracker, const MaskT* mask)
486  : mTracker(tracker)
487  , mMask(mask)
488  , mDt(tracker.voxelSize()*(TemporalScheme == math::TVD_RK1 ? 0.3f :
489  TemporalScheme == math::TVD_RK2 ? 0.9f : 1.0f))
490  , mInvDx(1.0f/tracker.voxelSize())
491  , mTask(0)
492 {
493 }
494 
495 template<typename GridT, typename InterruptT>
496 template<math::BiasedGradientScheme SpatialScheme,
497  math::TemporalIntegrationScheme TemporalScheme,
498  typename MaskT>
499 inline void
502 normalize()
503 {
505  mTracker.mLeafs->rebuildAuxBuffers(TemporalScheme == math::TVD_RK3 ? 2 : 1);
506 
507  for (int n=0, e=mTracker.getNormCount(); n < e; ++n) {
508 
510  switch(TemporalScheme) {//switch is resolved at compile-time
511  case math::TVD_RK1:
512  // Perform one explicit Euler step: t1 = t0 + dt
513  // Phi_t1(0) = Phi_t0(0) - dt * VdotG_t0(1)
514  mTask = boost::bind(&Normalizer::euler01, _1, _2);
515 
516  // Cook and swap buffer 0 and 1 such that Phi_t1(0) and Phi_t0(1)
517  this->cook(1);
518  break;
519  case math::TVD_RK2:
520  // Perform one explicit Euler step: t1 = t0 + dt
521  // Phi_t1(1) = Phi_t0(0) - dt * VdotG_t0(1)
522  mTask = boost::bind(&Normalizer::euler01, _1, _2);
523 
524  // Cook and swap buffer 0 and 1 such that Phi_t1(0) and Phi_t0(1)
525  this->cook(1);
526 
527  // Convex combine explicit Euler step: t2 = t0 + dt
528  // Phi_t2(1) = 1/2 * Phi_t0(1) + 1/2 * (Phi_t1(0) - dt * V.Grad_t1(0))
529  mTask = boost::bind(&Normalizer::euler12, _1, _2);
530 
531  // Cook and swap buffer 0 and 1 such that Phi_t2(0) and Phi_t1(1)
532  this->cook(1);
533  break;
534  case math::TVD_RK3:
535  // Perform one explicit Euler step: t1 = t0 + dt
536  // Phi_t1(1) = Phi_t0(0) - dt * VdotG_t0(1)
537  mTask = boost::bind(&Normalizer::euler01, _1, _2);
538 
539  // Cook and swap buffer 0 and 1 such that Phi_t1(0) and Phi_t0(1)
540  this->cook(1);
541 
542  // Convex combine explicit Euler step: t2 = t0 + dt/2
543  // Phi_t2(2) = 3/4 * Phi_t0(1) + 1/4 * (Phi_t1(0) - dt * V.Grad_t1(0))
544  mTask = boost::bind(&Normalizer::euler34, _1, _2);
545 
546  // Cook and swap buffer 0 and 2 such that Phi_t2(0) and Phi_t1(2)
547  this->cook(2);
548 
549  // Convex combine explicit Euler step: t3 = t0 + dt
550  // Phi_t3(2) = 1/3 * Phi_t0(1) + 2/3 * (Phi_t2(0) - dt * V.Grad_t2(0)
551  mTask = boost::bind(&Normalizer::euler13, _1, _2);
552 
553  // Cook and swap buffer 0 and 2 such that Phi_t3(0) and Phi_t2(2)
554  this->cook(2);
555  break;
556  default:
557  OPENVDB_THROW(ValueError, "Temporal integration scheme not supported!");
558  }
560  }
561  mTracker.mLeafs->removeAuxBuffers();
562 }
563 
566 template<typename GridT, typename InterruptT>
567 template<math::BiasedGradientScheme SpatialScheme,
568  math::TemporalIntegrationScheme TemporalScheme,
569  typename MaskT>
570 inline void
573 cook(int swapBuffer)
574 {
575  mTracker.startInterrupter("Normalizing Level Set");
576 
577  const int grainSize = mTracker.getGrainSize();
578  const LeafRange range = mTracker.leafs().leafRange(grainSize);
579 
580  if (grainSize>0) {
581  tbb::parallel_for(range, *this);
582  } else {
583  (*this)(range);
584  }
585 
586  mTracker.leafs().swapLeafBuffer(swapBuffer, grainSize==0);
587 
588  mTracker.endInterrupter();
589 }
590 
591 template<typename GridT, typename InterruptT>
592 template<math::BiasedGradientScheme SpatialScheme,
593  math::TemporalIntegrationScheme TemporalScheme,
594  typename MaskT>
595 template <int Nominator, int Denominator>
596 inline void
599 eval(StencilT& stencil, const ValueType* phi, ValueType* result, Index n) const
600 {
601  typedef typename math::ISGradientNormSqrd<SpatialScheme> GradientT;
602  static const ValueType alpha = ValueType(Nominator)/ValueType(Denominator);
603  static const ValueType beta = ValueType(1) - alpha;
604 
605  const ValueType normSqGradPhi = GradientT::result(stencil);
606  const ValueType phi0 = stencil.getValue();
607  ValueType v = phi0 / ( math::Sqrt(math::Pow2(phi0) + normSqGradPhi) +
609  v = phi0 - mDt * v * (math::Sqrt(normSqGradPhi) * mInvDx - 1.0f);
610  result[n] = Nominator ? alpha * phi[n] + beta * v : v;
611 }
612 
613 template<typename GridT, typename InterruptT>
614 template<math::BiasedGradientScheme SpatialScheme,
615  math::TemporalIntegrationScheme TemporalScheme,
616  typename MaskT>
617 template <int Nominator, int Denominator>
618 inline void
621 euler(const LeafRange& range, Index phiBuffer, Index resultBuffer)
622 {
623  typedef typename LeafType::ValueOnCIter VoxelIterT;
624 
625  mTracker.checkInterrupter();
626 
627  StencilT stencil(mTracker.grid());
628 
629  for (typename LeafRange::Iterator leafIter = range.begin(); leafIter; ++leafIter) {
630  const ValueType* phi = leafIter.buffer(phiBuffer).data();
631  ValueType* result = leafIter.buffer(resultBuffer).data();
632  if (mMask == NULL) {
633  for (VoxelIterT iter = leafIter->cbeginValueOn(); iter; ++iter) {
634  stencil.moveTo(iter);
635  this->eval<Nominator, Denominator>(stencil, phi, result, iter.pos());
636  }//loop over active voxels in the leaf of the level set
637  } else if (const MaskLeafT* mask = mMask->probeLeaf(leafIter->origin())) {
638  const ValueType* phi0 = leafIter->buffer().data();
639  for (MaskIterT iter = mask->cbeginValueOn(); iter; ++iter) {
640  const Index i = iter.pos();
641  stencil.moveTo(iter.getCoord(), phi0[i]);
642  this->eval<Nominator, Denominator>(stencil, phi, result, i);
643  }//loop over active voxels in the leaf of the mask
644  }
645  }//loop over leafs of the level set
646 }
647 
648 } // namespace tools
649 } // namespace OPENVDB_VERSION_NAME
650 } // namespace openvdb
651 
652 #endif // OPENVDB_TOOLS_LEVEL_SET_TRACKER_HAS_BEEN_INCLUDED
653 
654 // Copyright (c) 2012-2015 DreamWorks Animation LLC
655 // All rights reserved. This software is distributed under the
656 // Mozilla Public License 2.0 ( http://www.mozilla.org/MPL/2.0/ )
void dilate(int iterations=1)
Fast but approximate dilation of the narrow band - one layer at a time. Normally we recommend using t...
Definition: LevelSetTracker.h:310
static T value()
Definition: Math.h:125
bool resize(Index halfWidth=static_cast< Index >(LEVEL_SET_HALF_WIDTH))
Resize the width of the narrow band, i.e. perform dilation and renormalization or erosion as required...
Definition: LevelSetTracker.h:345
Index32 Index
Definition: Types.h:58
bool wasInterrupted(T *i, int percent=-1)
Definition: NullInterrupter.h:76
Definition: FiniteDifference.h:198
ValueType voxelSize() const
Definition: LevelSetTracker.h:174
math::TemporalIntegrationScheme getTemporalScheme() const
Definition: LevelSetTracker.h:154
Definition: FiniteDifference.h:263
Definition: Exceptions.h:88
int getNormCount() const
Definition: LevelSetTracker.h:161
State(math::BiasedGradientScheme s=math::HJWENO5_BIAS, math::TemporalIntegrationScheme t=math::TVD_RK1, int n=static_cast< int >(LEVEL_SET_HALF_WIDTH), int g=1)
Definition: LevelSetTracker.h:82
Performs multi-threaded interface tracking of narrow band level sets.
Definition: LevelSetTracker.h:67
#define OPENVDB_THROW(exception, message)
Definition: Exceptions.h:97
Efficient multi-threaded replacement of the background values in tree.
void endInterrupter()
Definition: LevelSetTracker.h:368
Definition: FiniteDifference.h:197
void rebuildLeafArray()
Remove the auxiliary buffers and rebuild the leaf array.
Definition: LeafManager.h:292
This class manages a linear array of pointers to a given tree&#39;s leaf nodes, as well as optional auxil...
Definition: LeafManager.h:114
int normCount
Definition: LevelSetTracker.h:88
Definition: Operators.h:152
void changeLevelSetBackground(TreeOrLeafManagerT &tree, const typename TreeOrLeafManagerT::ValueType &halfWidth, bool threaded=true, size_t grainSize=32)
Replace the background value in all the nodes of a floating-point tree containing a symmetric narrow-...
Definition: ChangeBackground.h:260
int grainSize
Definition: LevelSetTracker.h:89
OPENVDB_STATIC_SPECIALIZATION void dilateVoxels(TreeType &tree, int iterations=1, NearestNeighbors nn=NN_FACE)
Topologically dilate all leaf-level active voxels in a tree using one of three nearest neighbor conne...
Definition: Morphology.h:778
float RoundDown(float x)
Return x rounded down to the nearest integer.
Definition: Math.h:751
GridT::TreeType TreeType
Definition: LevelSetTracker.h:71
virtual ~LevelSetTracker()
Definition: LevelSetTracker.h:96
void track()
Track the level set interface, i.e. rebuild and normalize the narrow band of the level set...
Definition: LevelSetTracker.h:295
LeafManagerType::BufferType BufferType
Definition: LevelSetTracker.h:76
TreeType::template ValueConverter< bool >::Type BoolMaskType
Definition: LevelSetTracker.h:77
OPENVDB_STATIC_SPECIALIZATION void erodeVoxels(TreeType &tree, int iterations=1, NearestNeighbors nn=NN_FACE)
Topologically erode all leaf-level active voxels in the given tree.
Definition: Morphology.h:798
Definition: FiniteDifference.h:195
Defined various multi-threaded utility functions for trees.
Iterator begin() const
Definition: LeafManager.h:181
TreeType::ValueType ValueType
Definition: LevelSetTracker.h:73
GridT GridType
Definition: LevelSetTracker.h:70
void setTemporalScheme(math::TemporalIntegrationScheme scheme)
Set the spatial finite difference scheme.
Definition: LevelSetTracker.h:157
LeafManagerType & leafs()
Definition: LevelSetTracker.h:185
LeafManagerType::LeafRange LeafRange
Definition: LevelSetTracker.h:75
#define OPENVDB_VERSION_NAME
Definition: version.h:43
int getGrainSize() const
Definition: LevelSetTracker.h:168
tree::LeafManager< TreeType > LeafManagerType
Definition: LevelSetTracker.h:74
void setGrainSize(int grainsize)
Set the grain-size used for multi-threading.
Definition: LevelSetTracker.h:172
bool checkInterrupter()
Definition: LevelSetTracker.h:376
void pruneLevelSet(TreeT &tree, bool threaded=true, size_t grainSize=1)
Reduce the memory footprint of a tree by replacing nodes whose values are all inactive with inactive ...
Definition: Prune.h:402
Definition: Exceptions.h:86
Implementation of morphological dilation and erosion.
Definition: FiniteDifference.h:196
Definition: Exceptions.h:39
#define OPENVDB_NO_UNREACHABLE_CODE_WARNING_BEGIN
Definition: Platform.h:129
Definition: Types.h:419
void prune(TreeT &tree, typename TreeT::ValueType tolerance=zeroVal< typename TreeT::ValueType >(), bool threaded=true, size_t grainSize=1)
Reduce the memory footprint of a tree by replacing with tiles any nodes whose values are all the same...
Definition: Prune.h:347
CopyConstness< TreeType, NonConstBufferType >::Type BufferType
Definition: LeafManager.h:125
void setSpatialScheme(math::BiasedGradientScheme scheme)
Set the spatial finite difference scheme.
Definition: LevelSetTracker.h:151
Definition: Types.h:206
Lightweight struct that stores the state of the LevelSetTracker.
Definition: LevelSetTracker.h:81
void setNormCount(int n)
Set the number of normalizations performed per track or normalize call.
Definition: LevelSetTracker.h:165
Type Pow2(Type x)
Return .
Definition: Math.h:514
Definition: FiniteDifference.h:194
const GridType & grid() const
Definition: LevelSetTracker.h:183
void setState(const State &s)
Set the state of the tracker (see struct defined above)
Definition: LevelSetTracker.h:145
#define OPENVDB_NO_UNREACHABLE_CODE_WARNING_END
Definition: Platform.h:130
BiasedGradientScheme
Biased Gradients are limited to non-centered differences.
Definition: FiniteDifference.h:192
const LeafManagerType & leafs() const
Definition: LevelSetTracker.h:187
State getState() const
Return the state of the tracker (see struct defined above)
Definition: LevelSetTracker.h:142
GridType::Ptr normalize(const GridType &grid, bool threaded, InterruptT *interrupt)
Normalize the vectors of the given vector-valued grid.
Definition: GridOperators.h:1067
TreeType::LeafNodeType LeafType
Definition: LevelSetTracker.h:72
void erode(int iterations=1)
Erodes the width of the narrow-band and update the background values.
Definition: LevelSetTracker.h:334
Definition: FiniteDifference.h:265
ValueType getHalfWidth() const
Return the half width of the narrow band in floating-point voxel units.
Definition: LevelSetTracker.h:139
void prune()
Remove voxels that are outside the narrow band. (substep of track)
Definition: LevelSetTracker.h:276
Definition: FiniteDifference.h:264
#define OPENVDB_USE_VERSION_NAMESPACE
Definition: version.h:71
float Sqrt(float x)
Return the square root of a floating-point value.
Definition: Math.h:709
void startInterrupter(const char *msg)
Definition: LevelSetTracker.h:360
math::TemporalIntegrationScheme temporalScheme
Definition: LevelSetTracker.h:87
static const Real LEVEL_SET_HALF_WIDTH
Definition: Types.h:212
void normalize()
Iterative normalization, i.e. solving the Eikonal equation.
Definition: LevelSetTracker.h:104
TemporalIntegrationScheme
Temporal integration schemes.
Definition: FiniteDifference.h:261
math::BiasedGradientScheme spatialScheme
Definition: LevelSetTracker.h:86
math::BiasedGradientScheme getSpatialScheme() const
Definition: LevelSetTracker.h:148