OpenVDB 13.0.0

Loading...
Searching...
No Matches
Clip.h
Go to the documentation of this file.
1// Copyright Contributors to the OpenVDB Project
2// SPDX-License-Identifier: Apache-2.0
3
4/// @file Clip.h
5///
6/// @brief Functions to clip a grid against a bounding box, a camera frustum,
7/// or another grid's active voxel topology
8
9#ifndef OPENVDB_TOOLS_CLIP_HAS_BEEN_INCLUDED
10#define OPENVDB_TOOLS_CLIP_HAS_BEEN_INCLUDED
11
12#include <openvdb/Grid.h>
13#include <openvdb/math/Math.h> // for math::isNegative()
14#include <openvdb/math/Maps.h> // for math::NonlinearFrustumMap
15#include <openvdb/tree/LeafManager.h>
16#include <openvdb/points/PointDataGrid.h>
17#include "GridTransformer.h" // for tools::resampleToMatch()
18#include "Prune.h"
19#include <tbb/blocked_range.h>
20#include <tbb/parallel_reduce.h>
21#include <type_traits> // for std::enable_if, std::is_same
22#include <vector>
23
24
25 namespace openvdb {
26 OPENVDB_USE_VERSION_NAMESPACE
27 namespace OPENVDB_VERSION_NAME {
28 namespace tools {
29
30/// @brief Clip the given grid against a world-space bounding box
31/// and return a new grid containing the result.
32/// @param grid the grid to be clipped
33/// @param bbox a world-space bounding box
34/// @param keepInterior if true, discard voxels that lie outside the bounding box;
35/// if false, discard voxels that lie inside the bounding box
36/// @warning Clipping a level set will likely produce a grid that is
37/// no longer a valid level set.
38 template<typename GridType>
39 typename GridType::Ptr
40 clip(const GridType& grid, const BBoxd& bbox, bool keepInterior = true);
41
42/// @brief Clip the given grid against a frustum and return a new grid containing the result.
43/// @param grid the grid to be clipped
44/// @param frustum a frustum map
45/// @param keepInterior if true, discard voxels that lie outside the frustum;
46/// if false, discard voxels that lie inside the frustum
47/// @warning Clipping a level set will likely produce a grid that is
48/// no longer a valid level set.
49 template<typename GridType>
50 typename GridType::Ptr
51 clip(const GridType& grid, const math::NonlinearFrustumMap& frustum, bool keepInterior = true);
52
53/// @brief Clip a grid against the active voxels of another grid
54/// and return a new grid containing the result.
55/// @param grid the grid to be clipped
56/// @param mask a grid whose active voxels form a boolean clipping mask
57/// @param keepInterior if true, discard voxels that do not intersect the mask;
58/// if false, discard voxels that intersect the mask
59/// @details The mask grid need not have the same transform as the source grid.
60/// Also, if the mask grid is a level set, consider using tools::sdfInteriorMask
61/// to construct a new mask comprising the interior (rather than the narrow band)
62/// of the level set.
63/// @warning Clipping a level set will likely produce a grid that is
64/// no longer a valid level set.
65 template<typename GridType, typename MaskTreeType>
66 typename GridType::Ptr
67 clip(const GridType& grid, const Grid<MaskTreeType>& mask, bool keepInterior = true);
68
69
70////////////////////////////////////////
71
72/// @cond OPENVDB_DOCS_INTERNAL
73
74 namespace clip_internal {
75
76// Use either MaskGrids or BoolGrids internally.
77// (MaskGrids have a somewhat lower memory footprint.)
78 using MaskValueType = ValueMask;
79//using MaskValueType = bool;
80
81
82 template<typename TreeT>
83 class MaskInteriorVoxels
84{
85 public:
86 using ValueT = typename TreeT::ValueType;
87 using LeafNodeT = typename TreeT::LeafNodeType;
88
89 MaskInteriorVoxels(const TreeT& tree): mAcc(tree) {}
90
91 template<typename LeafNodeType>
92 void operator()(LeafNodeType& leaf, size_t /*leafIndex*/) const
93 {
94 const auto* refLeaf = mAcc.probeConstLeaf(leaf.origin());
95 if (refLeaf) {
96 for (auto iter = leaf.beginValueOff(); iter; ++iter) {
97 const auto pos = iter.pos();
98 leaf.setActiveState(pos, math::isNegative(refLeaf->getValue(pos)));
99 }
100 }
101 }
102
103 private:
104 tree::ValueAccessor<const TreeT> mAcc;
105};
106
107
108////////////////////////////////////////
109
110
111 template<typename TreeT>
112 class CopyLeafNodes
113{
114 public:
115 using MaskTreeT = typename TreeT::template ValueConverter<MaskValueType>::Type;
116 using MaskLeafManagerT = tree::LeafManager<const MaskTreeT>;
117
118 CopyLeafNodes(const TreeT&, const MaskLeafManagerT&);
119
120 void run(bool threaded = true);
121
122 typename TreeT::Ptr tree() const { return mNewTree; }
123
124 CopyLeafNodes(CopyLeafNodes&, tbb::split);
125 void operator()(const tbb::blocked_range<size_t>&);
126 void join(const CopyLeafNodes& rhs) { mNewTree->merge(*rhs.mNewTree); }
127
128 private:
129 const MaskTreeT* mClipMask;
130 const TreeT* mTree;
131 const MaskLeafManagerT* mLeafNodes;
132 typename TreeT::Ptr mNewTree;
133};
134
135
136 template<typename TreeT>
137CopyLeafNodes<TreeT>::CopyLeafNodes(const TreeT& tree, const MaskLeafManagerT& leafNodes)
138 : mTree(&tree)
139 , mLeafNodes(&leafNodes)
140 , mNewTree(new TreeT(mTree->background()))
141{
142}
143
144
145 template<typename TreeT>
146CopyLeafNodes<TreeT>::CopyLeafNodes(CopyLeafNodes& rhs, tbb::split)
147 : mTree(rhs.mTree)
148 , mLeafNodes(rhs.mLeafNodes)
149 , mNewTree(new TreeT(mTree->background()))
150{
151}
152
153
154 template<typename TreeT>
155 void
156CopyLeafNodes<TreeT>::run(bool threaded)
157{
158 if (threaded) tbb::parallel_reduce(mLeafNodes->getRange(), *this);
159 else (*this)(mLeafNodes->getRange());
160}
161
162
163 template<typename TreeT>
164 void
165CopyLeafNodes<TreeT>::operator()(const tbb::blocked_range<size_t>& range)
166{
167 tree::ValueAccessor<TreeT> acc(*mNewTree);
168 tree::ValueAccessor<const TreeT> refAcc(*mTree);
169
170 for (auto n = range.begin(); n != range.end(); ++n) {
171 const auto& maskLeaf = mLeafNodes->leaf(n);
172 const auto& ijk = maskLeaf.origin();
173 const auto* refLeaf = refAcc.probeConstLeaf(ijk);
174
175 auto* newLeaf = acc.touchLeaf(ijk);
176
177 if (refLeaf) {
178 for (auto it = maskLeaf.cbeginValueOn(); it; ++it) {
179 const auto pos = it.pos();
180 newLeaf->setValueOnly(pos, refLeaf->getValue(pos));
181 newLeaf->setActiveState(pos, refLeaf->isValueOn(pos));
182 }
183 } else {
184 typename TreeT::ValueType value;
185 bool isActive = refAcc.probeValue(ijk, value);
186
187 for (auto it = maskLeaf.cbeginValueOn(); it; ++it) {
188 const auto pos = it.pos();
189 newLeaf->setValueOnly(pos, value);
190 newLeaf->setActiveState(pos, isActive);
191 }
192 }
193 }
194}
195
196
197////////////////////////////////////////
198
199
200 struct BoolSampler
201{
202 static const char* name() { return "bin"; }
203 static int radius() { return 2; }
204 static bool mipmap() { return false; }
205 static bool consistent() { return true; }
206
207 template<class TreeT>
208 static bool sample(const TreeT& inTree,
209 const Vec3R& inCoord, typename TreeT::ValueType& result)
210 {
211 return inTree.probeValue(Coord::floor(inCoord), result);
212 }
213};
214
215
216////////////////////////////////////////
217
218
219// Convert a grid of one type to a grid of another type
220 template<typename FromGridT, typename ToGridT>
221 struct ConvertGrid
222{
223 using FromGridCPtrT = typename FromGridT::ConstPtr;
224 using ToGridPtrT = typename ToGridT::Ptr;
225 ToGridPtrT operator()(const FromGridCPtrT& grid) { return ToGridPtrT(new ToGridT(*grid)); }
226};
227
228// Partial specialization that avoids copying when
229// the input and output grid types are the same
230 template<typename GridT>
231 struct ConvertGrid<GridT, GridT>
232{
233 using GridCPtrT = typename GridT::ConstPtr;
234 GridCPtrT operator()(const GridCPtrT& grid) { return grid; }
235};
236
237
238////////////////////////////////////////
239
240
241// Convert a grid of arbitrary type to a mask grid with the same tree configuration
242// and return a pointer to the new grid.
243/// @private
244 template<typename GridT>
245 typename std::enable_if<!std::is_same<MaskValueType, typename GridT::BuildType>::value,
246 typename GridT::template ValueConverter<MaskValueType>::Type::Ptr>::type
247convertToMaskGrid(const GridT& grid)
248{
249 using MaskGridT = typename GridT::template ValueConverter<MaskValueType>::Type;
250 auto mask = MaskGridT::create(/*background=*/false);
251 mask->topologyUnion(grid);
252 mask->setTransform(grid.constTransform().copy());
253 return mask;
254}
255
256// Overload that avoids any processing if the input grid is already a mask grid
257/// @private
258 template<typename GridT>
259 typename std::enable_if<std::is_same<MaskValueType, typename GridT::BuildType>::value,
260 typename GridT::ConstPtr>::type
261convertToMaskGrid(const GridT& grid)
262{
263 return grid.copy(); // shallow copy
264}
265
266
267////////////////////////////////////////
268
269
270/// @private
271 template<typename GridType>
272 typename GridType::Ptr
273doClip(
274 const GridType& grid,
275 const typename GridType::template ValueConverter<MaskValueType>::Type& clipMask,
276 bool keepInterior)
277{
278 using TreeT = typename GridType::TreeType;
279 using MaskTreeT = typename GridType::TreeType::template ValueConverter<MaskValueType>::Type;
280
281 const auto gridClass = grid.getGridClass();
282 const auto& tree = grid.tree();
283
284 MaskTreeT gridMask(false);
285 gridMask.topologyUnion(tree);
286
287 if (gridClass == GRID_LEVEL_SET) {
288 tree::LeafManager<MaskTreeT> leafNodes(gridMask);
289 leafNodes.foreach(MaskInteriorVoxels<TreeT>(tree));
290
291 tree::ValueAccessor<const TreeT> acc(tree);
292
293 typename MaskTreeT::ValueAllIter iter(gridMask);
294 iter.setMaxDepth(MaskTreeT::ValueAllIter::LEAF_DEPTH - 1);
295
296 for ( ; iter; ++iter) {
297 iter.setActiveState(math::isNegative(acc.getValue(iter.getCoord())));
298 }
299 }
300
301 if (keepInterior) {
302 gridMask.topologyIntersection(clipMask.constTree());
303 } else {
304 gridMask.topologyDifference(clipMask.constTree());
305 }
306
307 auto outGrid = grid.copyWithNewTree();
308 {
309 // Copy voxel values and states.
310 tree::LeafManager<const MaskTreeT> leafNodes(gridMask);
311 CopyLeafNodes<TreeT> maskOp(tree, leafNodes);
312 maskOp.run();
313 outGrid->setTree(maskOp.tree());
314 }
315 {
316 // Copy tile values and states.
317 tree::ValueAccessor<const TreeT> refAcc(tree);
318 tree::ValueAccessor<const MaskTreeT> maskAcc(gridMask);
319
320 typename TreeT::ValueAllIter it(outGrid->tree());
321 it.setMaxDepth(TreeT::ValueAllIter::LEAF_DEPTH - 1);
322 for ( ; it; ++it) {
323 Coord ijk = it.getCoord();
324
325 if (maskAcc.isValueOn(ijk)) {
326 typename TreeT::ValueType value;
327 bool isActive = refAcc.probeValue(ijk, value);
328
329 it.setValue(value);
330 if (!isActive) it.setValueOff();
331 }
332 }
333 }
334
335 outGrid->setTransform(grid.transform().copy());
336 if (gridClass != GRID_LEVEL_SET) outGrid->setGridClass(gridClass);
337
338 return outGrid;
339}
340
341} // namespace clip_internal
342
343/// @endcond
344
345
346////////////////////////////////////////
347
348
349/// @private
350 template<typename GridType>
351 typename GridType::Ptr
352 clip(const GridType& grid, const BBoxd& bbox, bool keepInterior)
353{
354 using MaskValueT = clip_internal::MaskValueType;
355 using MaskGridT = typename GridType::template ValueConverter<MaskValueT>::Type;
356
357 // Transform the world-space bounding box into the source grid's index space.
358 Vec3d idxMin, idxMax;
359 math::calculateBounds(grid.constTransform(), bbox.min(), bbox.max(), idxMin, idxMax);
360 CoordBBox region(Coord::floor(idxMin), Coord::floor(idxMax));
361 // Construct a boolean mask grid that is true inside the index-space bounding box
362 // and false everywhere else.
363 MaskGridT clipMask(/*background=*/false);
364 clipMask.fill(region, /*value=*/true, /*active=*/true);
365
366 return clip_internal::doClip(grid, clipMask, keepInterior);
367}
368
369
370/// @private
371 template<typename SrcGridType, typename ClipTreeType>
372 typename SrcGridType::Ptr
373clip(const SrcGridType& srcGrid, const Grid<ClipTreeType>& clipGrid, bool keepInterior)
374{
375 using MaskValueT = clip_internal::MaskValueType;
376 using ClipGridType = Grid<ClipTreeType>;
377 using SrcMaskGridType = typename SrcGridType::template ValueConverter<MaskValueT>::Type;
378 using ClipMaskGridType = typename ClipGridType::template ValueConverter<MaskValueT>::Type;
379
380 // Convert the clipping grid to a boolean-valued mask grid with the same tree configuration.
381 auto maskGrid = clip_internal::convertToMaskGrid(clipGrid);
382
383 // Resample the mask grid into the source grid's index space.
384 if (srcGrid.constTransform() != maskGrid->constTransform()) {
385 auto resampledMask = ClipMaskGridType::create(/*background=*/false);
386 resampledMask->setTransform(srcGrid.constTransform().copy());
387 tools::resampleToMatch<clip_internal::BoolSampler>(*maskGrid, *resampledMask);
388 tools::prune(resampledMask->tree());
389 maskGrid = resampledMask;
390 }
391
392 // Convert the mask grid to a mask grid with the same tree configuration as the source grid.
393 auto clipMask = clip_internal::ConvertGrid<
394 /*from=*/ClipMaskGridType, /*to=*/SrcMaskGridType>()(maskGrid);
395
396 // Clip the source grid against the mask grid.
397 return clip_internal::doClip(srcGrid, *clipMask, keepInterior);
398}
399
400
401/// @private
402 template<typename GridType>
403 typename GridType::Ptr
404 clip(const GridType& inGrid, const math::NonlinearFrustumMap& frustumMap, bool keepInterior)
405{
406 using ValueT = typename GridType::ValueType;
407 using TreeT = typename GridType::TreeType;
408 using LeafT = typename TreeT::LeafNodeType;
409
410 const auto& gridXform = inGrid.transform();
411 const auto frustumIndexBBox = frustumMap.getBBox();
412
413 // Return true if index-space point (i,j,k) lies inside the frustum.
414 auto frustumContainsCoord = [&](const Coord& ijk) -> bool {
415 auto xyz = gridXform.indexToWorld(ijk);
416 xyz = frustumMap.applyInverseMap(xyz);
417 return frustumIndexBBox.isInside(xyz);
418 };
419
420 // Return the frustum index-space bounding box of the corners of
421 // the given grid index-space bounding box.
422 auto toFrustumIndexSpace = [&](const CoordBBox& inBBox) -> BBoxd {
423 const Coord bounds[2] = { inBBox.min(), inBBox.max() };
424 Coord ijk;
425 BBoxd outBBox;
426 for (int i = 0; i < 8; ++i) {
427 ijk[0] = bounds[(i & 1) >> 0][0];
428 ijk[1] = bounds[(i & 2) >> 1][1];
429 ijk[2] = bounds[(i & 4) >> 2][2];
430 auto xyz = gridXform.indexToWorld(ijk);
431 xyz = frustumMap.applyInverseMap(xyz);
432 outBBox.expand(xyz);
433 }
434 return outBBox;
435 };
436
437 // Construct an output grid with the same transform and metadata as the input grid.
438 auto outGrid = inGrid.copyWithNewTree();
439 if (outGrid->getGridClass() == GRID_LEVEL_SET) {
440 // After clipping, a level set grid might no longer be a valid SDF.
441 outGrid->setGridClass(GRID_UNKNOWN);
442 }
443
444 const auto& bg = outGrid->background();
445
446 auto outAcc = outGrid->getAccessor();
447
448 // Copy active and inactive tiles that intersect the clipping region
449 // from the input grid to the output grid.
450 // ("Clipping region" refers to either the interior or the exterior
451 // of the frustum, depending on the value of keepInterior.)
452 auto tileIter = inGrid.beginValueAll();
453 tileIter.setMaxDepth(GridType::ValueAllIter::LEAF_DEPTH - 1);
454 CoordBBox tileBBox;
455 for ( ; tileIter; ++tileIter) {
456 const bool tileActive = tileIter.isValueOn();
457 const auto& tileValue = tileIter.getValue();
458
459 // Skip background tiles.
460 if (!tileActive && math::isApproxEqual(tileValue, bg)) continue;
461
462 // Transform the tile's bounding box into frustum index space.
463 tileIter.getBoundingBox(tileBBox);
464 const auto tileFrustumBBox = toFrustumIndexSpace(tileBBox);
465
466 // Determine whether any or all of the tile intersects the clipping region.
467 enum class CopyTile { kNone, kPartial, kFull };
468 auto copyTile = CopyTile::kNone;
469 if (keepInterior) {
470 if (frustumIndexBBox.isInside(tileFrustumBBox)) {
471 copyTile = CopyTile::kFull;
472 } else if (frustumIndexBBox.hasOverlap(tileFrustumBBox)) {
473 copyTile = CopyTile::kPartial;
474 }
475 } else {
476 if (!frustumIndexBBox.hasOverlap(tileFrustumBBox)) {
477 copyTile = CopyTile::kFull;
478 } else if (!frustumIndexBBox.isInside(tileFrustumBBox)) {
479 copyTile = CopyTile::kPartial;
480 }
481 }
482 switch (copyTile) {
483 case CopyTile::kNone:
484 break;
485 case CopyTile::kFull:
486 // Copy the entire tile.
487 outAcc.addTile(tileIter.getLevel(), tileBBox.min(), tileValue, tileActive);
488 break;
489 case CopyTile::kPartial:
490 // Copy only voxels inside the clipping region.
491 for (std::vector<CoordBBox> bboxVec = { tileBBox }; !bboxVec.empty(); ) {
492 // For efficiency, subdivide sufficiently large tiles and discard
493 // subregions based on additional bounding box intersection tests.
494 // The mimimum subregion size is chosen so that cost of the
495 // bounding box test is comparable to testing every voxel.
496 if (bboxVec.back().volume() > 64 && bboxVec.back().is_divisible()) {
497 // Subdivide this region in-place and append the other half to the list.
498 bboxVec.emplace_back(bboxVec.back(), tbb::split{});
499 continue;
500 }
501 auto subBBox = bboxVec.back();
502 bboxVec.pop_back();
503
504 // Discard the subregion if it lies completely outside the clipping region.
505 if (keepInterior) {
506 if (!frustumIndexBBox.hasOverlap(toFrustumIndexSpace(subBBox))) continue;
507 } else {
508 if (frustumIndexBBox.isInside(toFrustumIndexSpace(subBBox))) continue;
509 }
510
511 // Test every voxel within the subregion.
512 for (const auto& ijk: subBBox) {
513 if (frustumContainsCoord(ijk) == keepInterior) {
514 if (tileActive) {
515 outAcc.setValueOn(ijk, tileValue);
516 } else {
517 outAcc.setValueOff(ijk, tileValue);
518 }
519 }
520 }
521 }
522 break;
523 }
524 }
525 tools::prune(outGrid->tree());
526
527 // Ensure that the output grid has the same leaf node topology as the input grid,
528 // with the exception of leaf nodes that lie completely outside the clipping region.
529 // (This operation is serial.)
530 for (auto leafIter = inGrid.constTree().beginLeaf(); leafIter; ++leafIter) {
531 const auto leafBBox = leafIter->getNodeBoundingBox();
532 const auto leafFrustumBBox = toFrustumIndexSpace(leafBBox);
533 if (keepInterior) {
534 if (frustumIndexBBox.hasOverlap(leafFrustumBBox)) {
535 outAcc.touchLeaf(leafBBox.min());
536 }
537 } else {
538 if (!frustumIndexBBox.hasOverlap(leafFrustumBBox)
539 || !frustumIndexBBox.isInside(leafFrustumBBox))
540 {
541 outAcc.touchLeaf(leafBBox.min());
542 }
543 }
544 }
545
546 // In parallel across output leaf nodes, copy leaf voxels
547 // from the input grid to the output grid.
548 tree::LeafManager<TreeT> outLeafNodes{outGrid->tree()};
549 outLeafNodes.foreach(
550 [&](LeafT& leaf, size_t /*idx*/) {
551 auto inAcc = inGrid.getConstAccessor();
552 ValueT val;
553 for (auto voxelIter = leaf.beginValueAll(); voxelIter; ++voxelIter) {
554 const auto ijk = voxelIter.getCoord();
555 if (frustumContainsCoord(ijk) == keepInterior) {
556 const bool active = inAcc.probeValue(ijk, val);
557 voxelIter.setValue(val);
558 voxelIter.setValueOn(active);
559 }
560 }
561 }
562 );
563
564 return outGrid;
565}
566
567
568////////////////////////////////////////
569
570
571// Explicit Template Instantiation
572
573#ifdef OPENVDB_USE_EXPLICIT_INSTANTIATION
574
575#ifdef OPENVDB_INSTANTIATE_CLIP
576#include <openvdb/util/ExplicitInstantiation.h>
577#endif
578
579#define _FUNCTION(TreeT) \
580 Grid<TreeT>::Ptr clip(const Grid<TreeT>&, const BBoxd&, bool)
581 OPENVDB_VOLUME_TREE_INSTANTIATE(_FUNCTION)
582#undef _FUNCTION
583
584#define _FUNCTION(TreeT) \
585 Grid<TreeT>::Ptr clip(const Grid<TreeT>&, const math::NonlinearFrustumMap&, bool)
586 OPENVDB_ALL_TREE_INSTANTIATE(_FUNCTION)
587#undef _FUNCTION
588
589#define _FUNCTION(TreeT) \
590 Grid<TreeT>::Ptr clip_internal::doClip(const Grid<TreeT>&, const MaskGrid&, bool)
591 OPENVDB_VOLUME_TREE_INSTANTIATE(_FUNCTION)
592#undef _FUNCTION
593
594#endif // OPENVDB_USE_EXPLICIT_INSTANTIATION
595
596
597} // namespace tools
598} // namespace OPENVDB_VERSION_NAME
599} // namespace openvdb
600
601#endif // OPENVDB_TOOLS_CLIP_HAS_BEEN_INCLUDED
ExplicitInstantiation.h
Grid.h
GridTransformer.h
LeafManager.h
A LeafManager manages a linear array of pointers to a given tree's leaf nodes, as well as optional au...
Maps.h
Math.h
General-purpose arithmetic and comparison routines, most of which accept arbitrary value types (or at...
PointDataGrid.h
Attribute-owned data structure for points. Point attributes are stored in leaf nodes and ordered by v...
Prune.h
Defined various multi-threaded utility functions for trees.
openvdb::v13_0::Coord::floor
static Coord floor(const Vec3< T > &xyz)
Return the largest integer coordinates that are not greater than xyz (node centered conversion).
Definition Coord.h:57
openvdb::v13_0::Grid
Container class that associates a tree with a transform and metadata.
Definition Grid.h:571
openvdb::v13_0::ValueMask
Definition Types.h:92
openvdb::v13_0::math::BBox::max
const Vec3T & max() const
Return a const reference to the maximum point of this bounding box.
Definition BBox.h:64
openvdb::v13_0::math::BBox::expand
void expand(ElementType padding)
Pad this bounding box.
Definition BBox.h:321
openvdb::v13_0::math::BBox::min
const Vec3T & min() const
Return a const reference to the minimum point of this bounding box.
Definition BBox.h:62
openvdb::v13_0::math::CoordBBox
Axis-aligned bounding box of signed integer coordinates.
Definition Coord.h:252
openvdb::v13_0::math::CoordBBox::min
const Coord & min() const
Definition Coord.h:324
openvdb::v13_0::math::Coord
Signed (x, y, z) 32-bit integer coordinates.
Definition Coord.h:26
openvdb::v13_0::math::NonlinearFrustumMap
This map is composed of three steps. First it will take a box of size (Lx X Ly X Lz) defined by a mem...
Definition Maps.h:1892
openvdb::v13_0::math::NonlinearFrustumMap::getBBox
const BBoxd & getBBox() const
Return the bounding box that defines the frustum in pre-image space.
Definition Maps.h:2363
openvdb::v13_0::math::NonlinearFrustumMap::applyInverseMap
Vec3d applyInverseMap(const Vec3d &in) const override
Return the pre-image of in under the map.
Definition Maps.h:2103
openvdb::v13_0::tree::LeafManager
This class manages a linear array of pointers to a given tree's leaf nodes, as well as optional auxil...
Definition LeafManager.h:86
openvdb::v13_0::tree::LeafManager::foreach
void foreach(const LeafOp &op, bool threaded=true, size_t grainSize=1)
Threaded method that applies a user-supplied functor to each leaf node in the LeafManager.
Definition LeafManager.h:484
openvdb::v13_0::ax::run
OPENVDB_AX_API void run(const char *ax, openvdb::GridBase &grid, const AttributeBindings &bindings={})
Run a full AX pipeline (parse, compile and execute) on a single OpenVDB Grid.
openvdb::v13_0::math::isApproxEqual
bool isApproxEqual(const Type &a, const Type &b, const Type &tolerance)
Return true if a is equal to b to within the given tolerance.
Definition Math.h:431
openvdb::v13_0::math::calculateBounds
OPENVDB_API void calculateBounds(const Transform &t, const Vec3d &minWS, const Vec3d &maxWS, Vec3d &minIS, Vec3d &maxIS)
Calculate an axis-aligned bounding box in index space from an axis-aligned bounding box in world spac...
openvdb::v13_0::math::isNegative
bool isNegative(const Type &x)
Return true if x is less than zero.
Definition Math.h:380
openvdb::v13_0::math::Vec3d
Vec3< double > Vec3d
Definition Vec3.h:665
openvdb::v13_0::tools::outGrid
OutGridT & outGrid
Definition ValueTransformer.h:139
openvdb::v13_0::tools::prune
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:335
openvdb::v13_0::tools::clip
GridType::Ptr clip(const GridType &grid, const BBoxd &bbox, bool keepInterior=true)
Clip the given grid against a world-space bounding box and return a new grid containing the result.
Definition Clip.h:352
openvdb::v13_0::tools::resampleToMatch
void resampleToMatch(const GridType &inGrid, GridType &outGrid, Interrupter &interrupter)
Resample an input grid into an output grid of the same type such that, after resampling,...
Definition GridTransformer.h:486
openvdb::v13_0::tree
Definition PointDataGrid.h:170
openvdb::v13_0::tree::ValueAccessor
ValueAccessorImpl< TreeType, IsSafe, MutexType, openvdb::make_index_sequence< CacheLevels > > ValueAccessor
Default alias for a ValueAccessor. This is simply a helper alias for the generic definition but takes...
Definition ValueAccessor.h:86
openvdb::v13_0::GRID_LEVEL_SET
@ GRID_LEVEL_SET
Definition Types.h:522
openvdb::v13_0::GRID_UNKNOWN
@ GRID_UNKNOWN
Definition Types.h:521
openvdb::v13_0::BBoxd
math::BBox< Vec3d > BBoxd
Definition Types.h:65
openvdb
Definition Exceptions.h:13
OPENVDB_VERSION_NAME
#define OPENVDB_VERSION_NAME
The version namespace name for this library version.
Definition version.h.in:121
OPENVDB_USE_VERSION_NAMESPACE
#define OPENVDB_USE_VERSION_NAMESPACE
Definition version.h.in:218
OPENVDB_VOLUME_TREE_INSTANTIATE
#define OPENVDB_VOLUME_TREE_INSTANTIATE(Function)
Definition version.h.in:165
OPENVDB_ALL_TREE_INSTANTIATE
#define OPENVDB_ALL_TREE_INSTANTIATE(Function)
Definition version.h.in:166