/usr/include/openvdb/tools/Composite.h is in libopenvdb-dev 2.1.0-1ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 | ///////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2012-2013 DreamWorks Animation LLC
//
// All rights reserved. This software is distributed under the
// Mozilla Public License 2.0 ( http://www.mozilla.org/MPL/2.0/ )
//
// Redistributions of source code must retain the above copyright
// and license notice and the following restrictions and disclaimer.
//
// * Neither the name of DreamWorks Animation nor the names of
// its contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// IN NO EVENT SHALL THE COPYRIGHT HOLDERS' AND CONTRIBUTORS' AGGREGATE
// LIABILITY FOR ALL CLAIMS REGARDLESS OF THEIR BASIS EXCEED US$250.00.
//
///////////////////////////////////////////////////////////////////////////
//
/// @file Composite.h
///
/// @brief Functions to efficiently perform various compositing operations on grids
///
/// @author Peter Cucka
#ifndef OPENVDB_TOOLS_COMPOSITE_HAS_BEEN_INCLUDED
#define OPENVDB_TOOLS_COMPOSITE_HAS_BEEN_INCLUDED
#include <openvdb/Platform.h>
#include <openvdb/Exceptions.h>
#include <openvdb/Types.h>
#include <openvdb/Grid.h>
#include <openvdb/math/Math.h> // for isExactlyEqual()
#include "ValueTransformer.h" // for transformValues()
#include <boost/utility/enable_if.hpp>
namespace openvdb {
OPENVDB_USE_VERSION_NAMESPACE
namespace OPENVDB_VERSION_NAME {
namespace tools {
/// @brief Given two level set grids, replace the A grid with the union of A and B.
/// @throw ValueError if the background value of either grid is not greater than zero.
/// @note This operation always leaves the B grid empty.
template<typename GridOrTreeT> OPENVDB_STATIC_SPECIALIZATION
inline void csgUnion(GridOrTreeT& a, GridOrTreeT& b, bool prune = true);
/// @brief Given two level set grids, replace the A grid with the intersection of A and B.
/// @throw ValueError if the background value of either grid is not greater than zero.
/// @note This operation always leaves the B grid empty.
template<typename GridOrTreeT> OPENVDB_STATIC_SPECIALIZATION
inline void csgIntersection(GridOrTreeT& a, GridOrTreeT& b, bool prune = true);
/// @brief Given two level set grids, replace the A grid with the difference A / B.
/// @throw ValueError if the background value of either grid is not greater than zero.
/// @note This operation always leaves the B grid empty.
template<typename GridOrTreeT> OPENVDB_STATIC_SPECIALIZATION
inline void csgDifference(GridOrTreeT& a, GridOrTreeT& b, bool prune = true);
/// @brief Given grids A and B, compute max(a, b) per voxel (using sparse traversal).
/// Store the result in the A grid and leave the B grid empty.
template<typename GridOrTreeT> OPENVDB_STATIC_SPECIALIZATION
inline void compMax(GridOrTreeT& a, GridOrTreeT& b);
/// @brief Given grids A and B, compute min(a, b) per voxel (using sparse traversal).
/// Store the result in the A grid and leave the B grid empty.
template<typename GridOrTreeT> OPENVDB_STATIC_SPECIALIZATION
inline void compMin(GridOrTreeT& a, GridOrTreeT& b);
/// @brief Given grids A and B, compute a + b per voxel (using sparse traversal).
/// Store the result in the A grid and leave the B grid empty.
template<typename GridOrTreeT> OPENVDB_STATIC_SPECIALIZATION
inline void compSum(GridOrTreeT& a, GridOrTreeT& b);
/// @brief Given grids A and B, compute a * b per voxel (using sparse traversal).
/// Store the result in the A grid and leave the B grid empty.
template<typename GridOrTreeT> OPENVDB_STATIC_SPECIALIZATION
inline void compMul(GridOrTreeT& a, GridOrTreeT& b);
/// Copy the active voxels of B into A.
template<typename GridOrTreeT> OPENVDB_STATIC_SPECIALIZATION
inline void compReplace(GridOrTreeT& a, const GridOrTreeT& b);
////////////////////////////////////////
namespace composite {
// composite::min() and composite::max() for non-vector types compare with operator<().
template<typename T> inline
const typename boost::disable_if_c<VecTraits<T>::IsVec, T>::type& // = T if T is not a vector type
min(const T& a, const T& b) { return std::min(a, b); }
template<typename T> inline
const typename boost::disable_if_c<VecTraits<T>::IsVec, T>::type&
max(const T& a, const T& b) { return std::max(a, b); }
// composite::min() and composite::max() for OpenVDB vector types compare by magnitude.
template<typename T> inline
const typename boost::enable_if_c<VecTraits<T>::IsVec, T>::type& // = T if T is a vector type
min(const T& a, const T& b)
{
const typename T::ValueType aMag = a.lengthSqr(), bMag = b.lengthSqr();
return (aMag < bMag ? a : (bMag < aMag ? b : std::min(a, b)));
}
template<typename T> inline
const typename boost::enable_if_c<VecTraits<T>::IsVec, T>::type&
max(const T& a, const T& b)
{
const typename T::ValueType aMag = a.lengthSqr(), bMag = b.lengthSqr();
return (aMag < bMag ? b : (bMag < aMag ? a : std::max(a, b)));
}
} // namespace composite
template<typename GridOrTreeT>
OPENVDB_STATIC_SPECIALIZATION inline void
compMax(GridOrTreeT& aTree, GridOrTreeT& bTree)
{
typedef TreeAdapter<GridOrTreeT> Adapter;
typedef typename Adapter::TreeType TreeT;
typedef typename TreeT::ValueType ValueT;
struct Local {
static inline void op(CombineArgs<ValueT>& args) {
args.setResult(composite::max(args.a(), args.b()));
}
};
Adapter::tree(aTree).combineExtended(Adapter::tree(bTree), Local::op, /*prune=*/false);
}
template<typename GridOrTreeT>
OPENVDB_STATIC_SPECIALIZATION inline void
compMin(GridOrTreeT& aTree, GridOrTreeT& bTree)
{
typedef TreeAdapter<GridOrTreeT> Adapter;
typedef typename Adapter::TreeType TreeT;
typedef typename TreeT::ValueType ValueT;
struct Local {
static inline void op(CombineArgs<ValueT>& args) {
args.setResult(composite::min(args.a(), args.b()));
}
};
Adapter::tree(aTree).combineExtended(Adapter::tree(bTree), Local::op, /*prune=*/false);
}
template<typename GridOrTreeT>
OPENVDB_STATIC_SPECIALIZATION inline void
compSum(GridOrTreeT& aTree, GridOrTreeT& bTree)
{
typedef TreeAdapter<GridOrTreeT> Adapter;
typedef typename Adapter::TreeType TreeT;
struct Local {
static inline void op(CombineArgs<typename TreeT::ValueType>& args) {
args.setResult(args.a() + args.b());
}
};
Adapter::tree(aTree).combineExtended(Adapter::tree(bTree), Local::op, /*prune=*/false);
}
template<typename GridOrTreeT>
OPENVDB_STATIC_SPECIALIZATION inline void
compMul(GridOrTreeT& aTree, GridOrTreeT& bTree)
{
typedef TreeAdapter<GridOrTreeT> Adapter;
typedef typename Adapter::TreeType TreeT;
struct Local {
static inline void op(CombineArgs<typename TreeT::ValueType>& args) {
args.setResult(args.a() * args.b());
}
};
Adapter::tree(aTree).combineExtended(Adapter::tree(bTree), Local::op, /*prune=*/false);
}
////////////////////////////////////////
template<typename TreeT>
struct CompReplaceOp
{
TreeT* const aTree;
CompReplaceOp(TreeT& _aTree): aTree(&_aTree) {}
void operator()(const typename TreeT::ValueOnCIter& iter) const
{
CoordBBox bbox;
iter.getBoundingBox(bbox);
aTree->fill(bbox, *iter);
}
void operator()(const typename TreeT::LeafCIter& leafIter) const
{
tree::ValueAccessor<TreeT> acc(*aTree);
for (typename TreeT::LeafCIter::LeafNodeT::ValueOnCIter iter =
leafIter->cbeginValueOn(); iter; ++iter)
{
acc.setValue(iter.getCoord(), *iter);
}
}
};
template<typename GridOrTreeT>
OPENVDB_STATIC_SPECIALIZATION inline void
compReplace(GridOrTreeT& aTree, const GridOrTreeT& bTree)
{
typedef TreeAdapter<GridOrTreeT> Adapter;
typedef typename Adapter::TreeType TreeT;
typedef typename TreeT::ValueOnCIter ValueOnCIterT;
// Copy active states (but not values) from B to A.
Adapter::tree(aTree).topologyUnion(Adapter::tree(bTree));
CompReplaceOp<TreeT> op(Adapter::tree(aTree));
// Copy all active tile values from B to A.
ValueOnCIterT iter = bTree.cbeginValueOn();
iter.setMaxDepth(iter.getLeafDepth() - 1); // don't descend into leaf nodes
foreach(iter, op);
// Copy all active voxel values from B to A.
foreach(Adapter::tree(bTree).cbeginLeaf(), op);
}
////////////////////////////////////////
/// Base visitor class for CSG operations
/// (not intended to be used polymorphically, so no virtual functions)
template<typename TreeType>
class CsgVisitorBase
{
public:
typedef TreeType TreeT;
typedef typename TreeT::ValueType ValueT;
typedef typename TreeT::LeafNodeType::ChildAllIter ChildIterT;
enum { STOP = 3 };
CsgVisitorBase(const TreeT& aTree, const TreeT& bTree):
mAOutside(aTree.background()),
mAInside(math::negative(mAOutside)),
mBOutside(bTree.background()),
mBInside(math::negative(mBOutside))
{
const ValueT zero = zeroVal<ValueT>();
if (!(mAOutside > zero)) {
OPENVDB_THROW(ValueError,
"expected grid A outside value > 0, got " << mAOutside);
}
if (!(mAInside < zero)) {
OPENVDB_THROW(ValueError,
"expected grid A inside value < 0, got " << mAInside);
}
if (!(mBOutside > zero)) {
OPENVDB_THROW(ValueError,
"expected grid B outside value > 0, got " << mBOutside);
}
if (!(mBInside < zero)) {
OPENVDB_THROW(ValueError,
"expected grid B outside value < 0, got " << mBOutside);
}
}
protected:
ValueT mAOutside, mAInside, mBOutside, mBInside;
};
////////////////////////////////////////
template<typename TreeType>
struct CsgUnionVisitor: public CsgVisitorBase<TreeType>
{
typedef TreeType TreeT;
typedef typename TreeT::ValueType ValueT;
typedef typename TreeT::LeafNodeType::ChildAllIter ChildIterT;
enum { STOP = CsgVisitorBase<TreeT>::STOP };
CsgUnionVisitor(const TreeT& a, const TreeT& b): CsgVisitorBase<TreeT>(a, b) {}
/// Don't process nodes that are at different tree levels.
template<typename AIterT, typename BIterT>
inline int operator()(AIterT&, BIterT&) { return 0; }
/// Process root and internal nodes.
template<typename IterT>
inline int operator()(IterT& aIter, IterT& bIter)
{
ValueT aValue = zeroVal<ValueT>();
typename IterT::ChildNodeType* aChild = aIter.probeChild(aValue);
if (!aChild && aValue < zeroVal<ValueT>()) {
// A is an inside tile. Leave it alone and stop traversing this branch.
return STOP;
}
ValueT bValue = zeroVal<ValueT>();
typename IterT::ChildNodeType* bChild = bIter.probeChild(bValue);
if (!bChild && bValue < zeroVal<ValueT>()) {
// B is an inside tile. Make A an inside tile and stop traversing this branch.
aIter.setValue(this->mAInside);
aIter.setValueOn(bIter.isValueOn());
delete aChild;
return STOP;
}
if (!aChild && aValue > zeroVal<ValueT>()) {
// A is an outside tile. If B has a child, transfer it to A,
// otherwise leave A alone.
if (bChild) {
bIter.setValue(this->mBOutside);
bIter.setValueOff();
bChild->resetBackground(this->mBOutside, this->mAOutside);
aIter.setChild(bChild); // transfer child
delete aChild;
}
return STOP;
}
// If A has a child and B is an outside tile, stop traversing this branch.
// Continue traversal only if A and B both have children.
return (aChild && bChild) ? 0 : STOP;
}
/// Process leaf node values.
inline int operator()(ChildIterT& aIter, ChildIterT& bIter)
{
ValueT aValue, bValue;
aIter.probeValue(aValue);
bIter.probeValue(bValue);
if (aValue > bValue) { // a = min(a, b)
aIter.setValue(bValue);
aIter.setValueOn(bIter.isValueOn());
}
return 0;
}
};
////////////////////////////////////////
template<typename TreeType>
struct CsgIntersectVisitor: public CsgVisitorBase<TreeType>
{
typedef TreeType TreeT;
typedef typename TreeT::ValueType ValueT;
typedef typename TreeT::LeafNodeType::ChildAllIter ChildIterT;
enum { STOP = CsgVisitorBase<TreeT>::STOP };
CsgIntersectVisitor(const TreeT& a, const TreeT& b): CsgVisitorBase<TreeT>(a, b) {}
/// Don't process nodes that are at different tree levels.
template<typename AIterT, typename BIterT>
inline int operator()(AIterT&, BIterT&) { return 0; }
/// Process root and internal nodes.
template<typename IterT>
inline int operator()(IterT& aIter, IterT& bIter)
{
ValueT aValue = zeroVal<ValueT>();
typename IterT::ChildNodeType* aChild = aIter.probeChild(aValue);
if (!aChild && !(aValue < zeroVal<ValueT>())) {
// A is an outside tile. Leave it alone and stop traversing this branch.
return STOP;
}
ValueT bValue = zeroVal<ValueT>();
typename IterT::ChildNodeType* bChild = bIter.probeChild(bValue);
if (!bChild && !(bValue < zeroVal<ValueT>())) {
// B is an outside tile. Make A an outside tile and stop traversing this branch.
aIter.setValue(this->mAOutside);
aIter.setValueOn(bIter.isValueOn());
delete aChild;
return STOP;
}
if (!aChild && aValue < zeroVal<ValueT>()) {
// A is an inside tile. If B has a child, transfer it to A,
// otherwise leave A alone.
if (bChild) {
bIter.setValue(this->mBOutside);
bIter.setValueOff();
bChild->resetBackground(this->mBOutside, this->mAOutside);
aIter.setChild(bChild); // transfer child
delete aChild;
}
return STOP;
}
// If A has a child and B is an outside tile, stop traversing this branch.
// Continue traversal only if A and B both have children.
return (aChild && bChild) ? 0 : STOP;
}
/// Process leaf node values.
inline int operator()(ChildIterT& aIter, ChildIterT& bIter)
{
ValueT aValue, bValue;
aIter.probeValue(aValue);
bIter.probeValue(bValue);
if (aValue < bValue) { // a = max(a, b)
aIter.setValue(bValue);
aIter.setValueOn(bIter.isValueOn());
}
return 0;
}
};
////////////////////////////////////////
template<typename TreeType>
struct CsgDiffVisitor: public CsgVisitorBase<TreeType>
{
typedef TreeType TreeT;
typedef typename TreeT::ValueType ValueT;
typedef typename TreeT::LeafNodeType::ChildAllIter ChildIterT;
enum { STOP = CsgVisitorBase<TreeT>::STOP };
CsgDiffVisitor(const TreeT& a, const TreeT& b): CsgVisitorBase<TreeT>(a, b) {}
/// Don't process nodes that are at different tree levels.
template<typename AIterT, typename BIterT>
inline int operator()(AIterT&, BIterT&) { return 0; }
/// Process root and internal nodes.
template<typename IterT>
inline int operator()(IterT& aIter, IterT& bIter)
{
ValueT aValue = zeroVal<ValueT>();
typename IterT::ChildNodeType* aChild = aIter.probeChild(aValue);
if (!aChild && !(aValue < zeroVal<ValueT>())) {
// A is an outside tile. Leave it alone and stop traversing this branch.
return STOP;
}
ValueT bValue = zeroVal<ValueT>();
typename IterT::ChildNodeType* bChild = bIter.probeChild(bValue);
if (!bChild && bValue < zeroVal<ValueT>()) {
// B is an inside tile. Make A an inside tile and stop traversing this branch.
aIter.setValue(this->mAOutside);
aIter.setValueOn(bIter.isValueOn());
delete aChild;
return STOP;
}
if (!aChild && aValue < zeroVal<ValueT>()) {
// A is an inside tile. If B has a child, transfer it to A,
// otherwise leave A alone.
if (bChild) {
bIter.setValue(this->mBOutside);
bIter.setValueOff();
bChild->resetBackground(this->mBOutside, this->mAOutside);
aIter.setChild(bChild); // transfer child
bChild->negate();
delete aChild;
}
return STOP;
}
// If A has a child and B is an outside tile, stop traversing this branch.
// Continue traversal only if A and B both have children.
return (aChild && bChild) ? 0 : STOP;
}
/// Process leaf node values.
inline int operator()(ChildIterT& aIter, ChildIterT& bIter)
{
ValueT aValue, bValue;
aIter.probeValue(aValue);
bIter.probeValue(bValue);
bValue = math::negative(bValue);
if (aValue < bValue) { // a = max(a, -b)
aIter.setValue(bValue);
aIter.setValueOn(bIter.isValueOn());
}
return 0;
}
};
////////////////////////////////////////
template<typename GridOrTreeT>
OPENVDB_STATIC_SPECIALIZATION inline void
csgUnion(GridOrTreeT& a, GridOrTreeT& b, bool prune)
{
typedef TreeAdapter<GridOrTreeT> Adapter;
typedef typename Adapter::TreeType TreeT;
TreeT &aTree = Adapter::tree(a), &bTree = Adapter::tree(b);
CsgUnionVisitor<TreeT> visitor(aTree, bTree);
aTree.visit2(bTree, visitor);
if (prune) aTree.pruneLevelSet();
//if (prune) aTree.prune();
}
template<typename GridOrTreeT>
OPENVDB_STATIC_SPECIALIZATION inline void
csgIntersection(GridOrTreeT& a, GridOrTreeT& b, bool prune)
{
typedef TreeAdapter<GridOrTreeT> Adapter;
typedef typename Adapter::TreeType TreeT;
TreeT &aTree = Adapter::tree(a), &bTree = Adapter::tree(b);
CsgIntersectVisitor<TreeT> visitor(aTree, bTree);
aTree.visit2(bTree, visitor);
if (prune) aTree.pruneLevelSet();
//if (prune) aTree.prune();
}
template<typename GridOrTreeT>
OPENVDB_STATIC_SPECIALIZATION inline void
csgDifference(GridOrTreeT& a, GridOrTreeT& b, bool prune)
{
typedef TreeAdapter<GridOrTreeT> Adapter;
typedef typename Adapter::TreeType TreeT;
TreeT &aTree = Adapter::tree(a), &bTree = Adapter::tree(b);
CsgDiffVisitor<TreeT> visitor(aTree, bTree);
aTree.visit2(bTree, visitor);
if (prune) aTree.pruneLevelSet();
//if (prune) aTree.prune();
}
} // namespace tools
} // namespace OPENVDB_VERSION_NAME
} // namespace openvdb
#endif // OPENVDB_TOOLS_COMPOSITE_HAS_BEEN_INCLUDED
// Copyright (c) 2012-2013 DreamWorks Animation LLC
// All rights reserved. This software is distributed under the
// Mozilla Public License 2.0 ( http://www.mozilla.org/MPL/2.0/ )
|