39 #ifndef OPENVDB_TOOLS_LEVEL_SET_ADVECT_HAS_BEEN_INCLUDED 40 #define OPENVDB_TOOLS_LEVEL_SET_ADVECT_HAS_BEEN_INCLUDED 42 #include <tbb/parallel_for.h> 43 #include <tbb/parallel_reduce.h> 48 #include <boost/math/constants/constants.hpp> 98 template<
typename GridT,
99 typename FieldT = EnrightField<typename GridT::ValueType>,
100 typename InterruptT = util::NullInterrupter>
114 mTracker(grid, interrupt), mField(field),
116 mTemporalScheme(math::
TVD_RK2) {}
132 return mTracker.getSpatialScheme();
136 mTracker.setSpatialScheme(scheme);
140 return mTracker.getTemporalScheme();
144 mTracker.setTemporalScheme(scheme);
164 size_t advect(ValueType time0, ValueType time1);
179 Advect(
const Advect& other);
181 virtual ~Advect() {
if (mIsMaster) this->clearField(); }
184 size_t advect(ValueType time0, ValueType time1);
186 void operator()(
const LeafRange& r)
const 188 if (mTask) mTask(const_cast<Advect*>(
this), r);
192 void cook(
const char* msg,
size_t swapBuffer = 0);
194 typename GridT::ValueType sampleField(ValueType time0, ValueType time1);
195 template <
bool Aligned>
void sample(
const LeafRange& r, ValueType t0, ValueType t1);
196 inline void sampleXformed(
const LeafRange& r, ValueType t0, ValueType t1)
198 this->sample<false>(r, t0, t1);
200 inline void sampleAligned(
const LeafRange& r, ValueType t0, ValueType t1)
202 this->sample<true>(r, t0, t1);
207 template <
int Nominator,
int Denominator>
208 void euler(
const LeafRange&, ValueType,
Index,
Index);
209 inline void euler01(
const LeafRange& r, ValueType t) {this->euler<0,1>(r, t, 0, 1);}
210 inline void euler12(
const LeafRange& r, ValueType t) {this->euler<1,2>(r, t, 1, 1);}
211 inline void euler34(
const LeafRange& r, ValueType t) {this->euler<3,4>(r, t, 1, 2);}
212 inline void euler13(
const LeafRange& r, ValueType t) {this->euler<1,3>(r, t, 1, 2);}
214 LevelSetAdvection& mParent;
215 VectorType* mVelocity;
218 typename boost::function<void (Advect*, const LeafRange&)> mTask;
219 const bool mIsMaster;
222 template<math::BiasedGradientScheme SpatialScheme>
223 size_t advect1(ValueType time0, ValueType time1);
227 size_t advect2(ValueType time0, ValueType time1);
232 size_t advect3(ValueType time0, ValueType time1);
243 template<
typename Gr
idT,
typename FieldT,
typename InterruptT>
247 switch (mSpatialScheme) {
249 return this->advect1<math::FIRST_BIAS >(time0, time1);
251 return this->advect1<math::SECOND_BIAS >(time0, time1);
253 return this->advect1<math::THIRD_BIAS >(time0, time1);
255 return this->advect1<math::WENO5_BIAS >(time0, time1);
257 return this->advect1<math::HJWENO5_BIAS>(time0, time1);
265 template<
typename Gr
idT,
typename FieldT,
typename InterruptT>
266 template<math::BiasedGradientScheme SpatialScheme>
270 switch (mTemporalScheme) {
272 return this->advect2<SpatialScheme, math::TVD_RK1>(time0, time1);
274 return this->advect2<SpatialScheme, math::TVD_RK2>(time0, time1);
276 return this->advect2<SpatialScheme, math::TVD_RK3>(time0, time1);
284 template<
typename Gr
idT,
typename FieldT,
typename InterruptT>
285 template<math::BiasedGradientScheme SpatialScheme, math::TemporalIntegrationScheme TemporalScheme>
287 LevelSetAdvection<GridT, FieldT, InterruptT>::advect2(ValueType time0, ValueType time1)
290 if (trans.
mapType() == math::UniformScaleMap::mapType()) {
291 return this->advect3<SpatialScheme, TemporalScheme, math::UniformScaleMap>(time0, time1);
292 }
else if (trans.
mapType() == math::UniformScaleTranslateMap::mapType()) {
293 return this->advect3<SpatialScheme, TemporalScheme, math::UniformScaleTranslateMap>(
295 }
else if (trans.
mapType() == math::UnitaryMap::mapType()) {
296 return this->advect3<SpatialScheme, TemporalScheme, math::UnitaryMap >(time0, time1);
297 }
else if (trans.
mapType() == math::TranslationMap::mapType()) {
298 return this->advect3<SpatialScheme, TemporalScheme, math::TranslationMap>(time0, time1);
306 template<
typename Gr
idT,
typename FieldT,
typename InterruptT>
312 LevelSetAdvection<GridT, FieldT, InterruptT>::advect3(ValueType time0, ValueType time1)
314 Advect<MapT, SpatialScheme, TemporalScheme> tmp(*
this);
315 return tmp.advect(time0, time1);
322 template<
typename Gr
idT,
typename FieldT,
typename InterruptT>
328 LevelSetAdvection<GridT, FieldT, InterruptT>::
329 Advect<MapT, SpatialScheme, TemporalScheme>::
330 Advect(LevelSetAdvection& parent)
334 , mMap(parent.mTracker.grid().transform().template constMap<MapT>().get())
341 template<
typename Gr
idT,
typename FieldT,
typename InterruptT>
347 LevelSetAdvection<GridT, FieldT, InterruptT>::
348 Advect<MapT, SpatialScheme, TemporalScheme>::
349 Advect(
const Advect& other)
350 : mParent(other.mParent)
351 , mVelocity(other.mVelocity)
352 , mOffsets(other.mOffsets)
360 template<
typename Gr
idT,
typename FieldT,
typename InterruptT>
368 advect(ValueType time0, ValueType time1)
373 const bool isForward = time0 < time1;
374 while ((isForward ? time0<time1 : time0>time1) && mParent.mTracker.checkInterrupter()) {
377 mParent.mTracker.leafs().rebuildAuxBuffers(TemporalScheme ==
math::TVD_RK3 ? 2 : 1);
380 const ValueType dt = this->sampleField(time0, time1);
384 switch(TemporalScheme) {
388 mTask = boost::bind(&Advect::euler01, _1, _2, dt);
391 this->cook(
"Advecting level set using TVD_RK1", 1);
396 mTask = boost::bind(&Advect::euler01, _1, _2, dt);
399 this->cook(
"Advecting level set using TVD_RK1 (step 1 of 2)", 1);
403 mTask = boost::bind(&Advect::euler12, _1, _2, dt);
406 this->cook(
"Advecting level set using TVD_RK1 (step 2 of 2)", 1);
411 mTask = boost::bind(&Advect::euler01, _1, _2, dt);
414 this->cook(
"Advecting level set using TVD_RK3 (step 1 of 3)", 1);
418 mTask = boost::bind(&Advect::euler34, _1, _2, dt);
421 this->cook(
"Advecting level set using TVD_RK3 (step 2 of 3)", 2);
425 mTask = boost::bind(&Advect::euler13, _1, _2, dt);
428 this->cook(
"Advecting level set using TVD_RK3 (step 3 of 3)", 2);
431 OPENVDB_THROW(ValueError,
"Temporal integration scheme not supported!");
435 time0 += isForward ? dt : -dt;
437 mParent.mTracker.leafs().removeAuxBuffers();
440 mParent.mTracker.track();
446 template<
typename Gr
idT,
typename FieldT,
typename InterruptT>
451 inline typename GridT::ValueType
452 LevelSetAdvection<GridT, FieldT, InterruptT>::
453 Advect<MapT, SpatialScheme, TemporalScheme>::
454 sampleField(ValueType time0, ValueType time1)
456 const int grainSize = mParent.mTracker.getGrainSize();
457 const size_t leafCount = mParent.mTracker.leafs().leafCount();
458 if (leafCount==0)
return ValueType(0.0);
461 size_t size=0, voxelCount=mParent.mTracker.leafs().getPrefixSum(mOffsets,
size, grainSize);
464 if (mParent.mField.transform() == mParent.mTracker.grid().transform()) {
465 mTask = boost::bind(&Advect::sampleAligned, _1, _2, time0, time1);
467 mTask = boost::bind(&Advect::sampleXformed, _1, _2, time0, time1);
469 assert(voxelCount == mParent.mTracker.grid().activeVoxelCount());
470 mVelocity =
new VectorType[ voxelCount ];
471 this->cook(
"Sampling advection field");
474 ValueType maxAbsV = 0;
475 VectorType* v = mVelocity;
476 for (
size_t i = 0;
i < voxelCount; ++
i, ++v) {
477 maxAbsV =
math::Max(maxAbsV, ValueType(v->lengthSqr()));
482 #ifndef _MSC_VER // Visual C++ doesn't guarantee thread-safe initialization of local statics 485 const ValueType CFL = (TemporalScheme ==
math::TVD_RK1 ? ValueType(0.3) :
486 TemporalScheme == math::
TVD_RK2 ? ValueType(0.9) :
487 ValueType(1.0))/math::
Sqrt(ValueType(3.0));
488 const ValueType dt =
math::Abs(time1 - time0), dx = mParent.mTracker.voxelSize();
493 template<
typename Gr
idT,
typename FieldT,
typename InterruptT>
498 template<
bool Aligned>
500 LevelSetAdvection<GridT, FieldT, InterruptT>::
501 Advect<MapT, SpatialScheme, TemporalScheme>::
502 sample(
const LeafRange& range, ValueType time0, ValueType time1)
504 const bool isForward = time0 < time1;
505 typedef typename LeafType::ValueOnCIter VoxelIterT;
506 const MapT& map = *mMap;
507 const FieldT field( mParent.mField );
508 mParent.mTracker.checkInterrupter();
509 for (
typename LeafRange::Iterator leafIter = range.begin(); leafIter; ++leafIter) {
510 VectorType* vel = mVelocity + mOffsets[ leafIter.pos() ];
511 for (VoxelIterT iter = leafIter->cbeginValueOn(); iter; ++iter, ++vel) {
512 const VectorType v = Aligned ? field(iter.getCoord(), time0) :
513 field(map.applyMap(iter.getCoord().asVec3d()), time0);
514 *vel = isForward ? v : -v;
520 template<
typename Gr
idT,
typename FieldT,
typename InterruptT>
526 LevelSetAdvection<GridT, FieldT, InterruptT>::
527 Advect<MapT, SpatialScheme, TemporalScheme>::
537 template<
typename Gr
idT,
typename FieldT,
typename InterruptT>
543 LevelSetAdvection<GridT, FieldT, InterruptT>::
544 Advect<MapT, SpatialScheme, TemporalScheme>::
545 cook(
const char* msg,
size_t swapBuffer)
547 mParent.mTracker.startInterrupter( msg );
549 const int grainSize = mParent.mTracker.getGrainSize();
550 const LeafRange range = mParent.mTracker.leafs().leafRange(grainSize);
552 grainSize == 0 ? (*this)(range) : tbb::parallel_for(range, *
this);
554 mParent.mTracker.leafs().swapLeafBuffer(swapBuffer, grainSize == 0);
556 mParent.mTracker.endInterrupter();
562 template<
typename Gr
idT,
typename FieldT,
typename InterruptT>
567 template <
int Nominator,
int Denominator>
569 LevelSetAdvection<GridT, FieldT, InterruptT>::
570 Advect<MapT, SpatialScheme, TemporalScheme>::
571 euler(
const LeafRange& range, ValueType dt,
Index phiBuffer,
Index resultBuffer)
573 typedef math::BIAS_SCHEME<SpatialScheme> SchemeT;
574 typedef typename SchemeT::template ISStencil<GridType>::StencilType StencilT;
575 typedef typename LeafType::ValueOnCIter VoxelIterT;
576 typedef math::GradientBiased<MapT, SpatialScheme> GradT;
578 static const ValueType Alpha = ValueType(Nominator)/ValueType(Denominator);
579 static const ValueType Beta = ValueType(1) - Alpha;
581 mParent.mTracker.checkInterrupter();
582 const MapT& map = *mMap;
583 StencilT stencil(mParent.mTracker.grid());
584 for (
typename LeafRange::Iterator leafIter = range.begin(); leafIter; ++leafIter) {
585 const VectorType* vel = mVelocity + mOffsets[ leafIter.pos() ];
586 const ValueType* phi = leafIter.buffer(phiBuffer).data();
587 ValueType* result = leafIter.buffer(resultBuffer).data();
588 for (VoxelIterT voxelIter = leafIter->cbeginValueOn(); voxelIter; ++voxelIter, ++vel) {
589 const Index i = voxelIter.pos();
590 stencil.moveTo(voxelIter);
592 stencil.getValue() - dt * vel->dot(GradT::result(map, stencil, *vel));
593 result[
i] = Nominator ? Alpha * phi[
i] + Beta * a : a;
602 #endif // OPENVDB_TOOLS_LEVEL_SET_ADVECT_HAS_BEEN_INCLUDED Definition: FiniteDifference.h:264
Definition: FiniteDifference.h:263
Definition: FiniteDifference.h:195
Performs multi-threaded interface tracking of narrow band level sets. This is the building-block for ...
const Type & Max(const Type &a, const Type &b)
Return the maximum of two values.
Definition: Math.h:545
TemporalIntegrationScheme
Temporal integration schemes.
Definition: FiniteDifference.h:261
Defines two simple wrapper classes for advection velocity fields as well as VelocitySampler and Veloc...
Definition: FiniteDifference.h:198
const Type & Min(const Type &a, const Type &b)
Return the minimum of two values.
Definition: Math.h:606
#define OPENVDB_THROW(exception, message)
Definition: Exceptions.h:101
Definition: FiniteDifference.h:194
tbb::atomic< Index32 > i
Definition: LeafBuffer.h:71
static T value()
Definition: Math.h:124
Index32 Index
Definition: Types.h:57
Definition: LeafManager.h:127
Definition: FiniteDifference.h:265
#define OPENVDB_VERSION_NAME
Definition: version.h:43
bool isZero(const Type &x)
Return true if x is exactly equal to zero.
Definition: Math.h:308
Coord Abs(const Coord &xyz)
Definition: Coord.h:509
Definition: Exceptions.h:39
Definition: Exceptions.h:92
bool isApproxZero(const Type &x)
Return true if x is equal to zero to within the default floating-point comparison tolerance...
Definition: Math.h:320
Definition: FiniteDifference.h:197
BiasedGradientScheme
Biased Gradients are limited to non-centered differences.
Definition: FiniteDifference.h:192
float Sqrt(float x)
Return the square root of a floating-point value.
Definition: Math.h:711
Definition: FiniteDifference.h:196
#define OPENVDB_USE_VERSION_NAMESPACE
Definition: version.h:71
static constexpr size_t size
The size of a LeafBuffer when LeafBuffer::mOutOfCore is atomic.
Definition: LeafBuffer.h:85