/usr/include/openvdb/points/PointMask.h is in libopenvdb-dev 5.0.0-1.
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 | ///////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2012-2017 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 points/PointMask.h
///
/// @author Dan Bailey
///
/// @brief Methods for extracting masks from VDB Point grids.
#ifndef OPENVDB_POINTS_POINT_MASK_HAS_BEEN_INCLUDED
#define OPENVDB_POINTS_POINT_MASK_HAS_BEEN_INCLUDED
#include <openvdb/openvdb.h>
#include <openvdb/tools/ValueTransformer.h> // valxform::SumOp
#include "PointDataGrid.h"
#include "IndexFilter.h"
#include <tbb/combinable.h>
#include <type_traits>
#include <vector>
namespace openvdb {
OPENVDB_USE_VERSION_NAMESPACE
namespace OPENVDB_VERSION_NAME {
namespace points {
/// @brief Extract a Mask Grid from a Point Data Grid
/// @param grid the PointDataGrid to extract the mask from.
/// @param includeGroups a vector of VDB Points groups to be included (default is all).
/// @param excludeGroups a vector of VDB Points groups to be excluded (default is none).
/// @note this method is only available for Bool Grids and Mask Grids
template <typename PointDataGridT,
typename MaskT = typename PointDataGridT::template ValueConverter<bool>::Type>
inline typename std::enable_if<std::is_same<typename MaskT::ValueType, bool>::value,
typename MaskT::Ptr>::type
convertPointsToMask(const PointDataGridT& grid,
const std::vector<Name>& includeGroups = std::vector<Name>(),
const std::vector<Name>& excludeGroups = std::vector<Name>());
/// @brief Extract a Mask Grid from a Point Data Grid using a new transform
/// @param grid the PointDataGrid to extract the mask from.
/// @param transform target transform for the mask.
/// @param includeGroups a vector of VDB Points groups to be included (default is all).
/// @param excludeGroups a vector of VDB Points groups to be excluded (default is none).
/// @note this method is only available for Bool Grids and Mask Grids
template <typename PointDataGridT,
typename MaskT = typename PointDataGridT::template ValueConverter<bool>::Type>
inline typename std::enable_if<std::is_same<typename MaskT::ValueType, bool>::value,
typename MaskT::Ptr>::type
convertPointsToMask(const PointDataGridT& grid,
const openvdb::math::Transform& transform,
const std::vector<Name>& includeGroups = std::vector<Name>(),
const std::vector<Name>& excludeGroups = std::vector<Name>());
////////////////////////////////////////
namespace point_mask_internal {
/// @brief Combines multiple grids into one by stealing leaf nodes and summing voxel values
/// This class is designed to work with thread local storage containers such as tbb::combinable
template<typename GridT>
struct GridCombinerOp
{
using CombinableT = typename tbb::combinable<GridT>;
using TreeT = typename GridT::TreeType;
using LeafT = typename TreeT::LeafNodeType;
using ValueType = typename TreeT::ValueType;
using SumOp = tools::valxform::SumOp<typename TreeT::ValueType>;
GridCombinerOp(GridT& grid)
: mTree(grid.tree()) {}
void operator()(const GridT& grid)
{
for (auto leaf = grid.tree().beginLeaf(); leaf; ++leaf) {
auto* newLeaf = mTree.probeLeaf(leaf->origin());
if (!newLeaf) {
// if the leaf doesn't yet exist in the new tree, steal it
auto& tree = const_cast<GridT&>(grid).tree();
mTree.addLeaf(tree.template stealNode<LeafT>(leaf->origin(),
zeroVal<ValueType>(), false));
}
else {
// otherwise increment existing values
for (auto iter = leaf->cbeginValueOn(); iter; ++iter) {
newLeaf->modifyValue(iter.getCoord(), SumOp(*iter));
}
}
}
}
private:
TreeT& mTree;
}; // struct GridCombinerOp
/// @brief Compute scalar grid from PointDataGrid while evaluating the point filter
template <typename GridT, typename PointDataGridT, typename FilterT>
struct PointsToScalarOp
{
using TreeT = typename GridT::TreeType;
using LeafManagerT = typename tree::LeafManager<TreeT>;
using ValueT = typename TreeT::LeafNodeType::ValueType;
PointsToScalarOp(const PointDataGridT& grid,
const FilterT& filter)
: mPointDataAccessor(grid.getConstAccessor())
, mFilter(filter) { }
void operator()(const typename LeafManagerT::LeafRange& range) const {
for (auto leaf = range.begin(); leaf; ++leaf) {
const auto* const pointLeaf =
mPointDataAccessor.probeConstLeaf(leaf->origin());
// assumes matching topology
assert(pointLeaf);
for (auto value = leaf->beginValueOn(); value; ++value) {
const Index64 count = points::iterCount(
pointLeaf->beginIndexVoxel(value.getCoord(), mFilter));
if (count > Index64(0)) {
value.setValue(static_cast<ValueT>(count));}
else {
// disable any empty voxels
value.setValueOn(false);
}
}
}
}
private:
const typename PointDataGridT::ConstAccessor mPointDataAccessor;
const FilterT& mFilter;
}; // struct PointsToScalarOp
/// @brief Compute scalar grid from PointDataGrid using a different transform
/// and while evaluating the point filter
template <typename GridT, typename PointDataGridT, typename FilterT>
struct PointsToTransformedScalarOp
{
using LeafManagerT = tree::LeafManager<const typename PointDataGridT::TreeType>;
using ValueType = typename GridT::TreeType::LeafNodeType::ValueType;
using HandleT = AttributeHandle<Vec3f>;
using CombinableT = typename GridCombinerOp<GridT>::CombinableT;
PointsToTransformedScalarOp(const math::Transform& newTransform,
const math::Transform& transform,
const FilterT& filter,
CombinableT& combinable)
: mNewTransform(newTransform)
, mTransform(transform)
, mFilter(filter)
, mCombinable(combinable) { }
void operator()(const typename LeafManagerT::LeafRange& range) const
{
auto& grid = mCombinable.local();
auto& countTree = grid.tree();
tree::ValueAccessor<typename GridT::TreeType> accessor(countTree);
for (auto leaf = range.begin(); leaf; ++leaf) {
auto handle = HandleT::create(leaf->constAttributeArray("P"));
for (auto iter = leaf->beginIndexOn(mFilter); iter; iter++) {
const Vec3d position = mTransform.indexToWorld(handle->get(*iter) +
iter.getCoord().asVec3d());
const Coord ijk = mNewTransform.worldToIndexCellCentered(position);
accessor.modifyValue(ijk, tools::valxform::SumOp<ValueType>(1));
}
}
}
private:
const openvdb::math::Transform& mNewTransform;
const openvdb::math::Transform& mTransform;
const FilterT& mFilter;
CombinableT& mCombinable;
}; // struct PointsToTransformedScalarOp
template<typename PointDataGridT, typename GridT>
inline typename GridT::Ptr convertPointsToScalar(
const PointDataGridT& points,
const std::vector<Name>& includeGroups,
const std::vector<Name>& excludeGroups)
{
using point_mask_internal::PointsToScalarOp;
using GridTreeT = typename GridT::TreeType;
using ValueT = typename GridTreeT::ValueType;
// copy the topology from the points grid
typename GridTreeT::Ptr tree(new GridTreeT(points.constTree(),
false, openvdb::TopologyCopy()));
typename GridT::Ptr grid = GridT::create(tree);
grid->setTransform(points.transform().copy());
// early exit if no leaves
if (points.constTree().leafCount() == 0) return grid;
const bool useGroup = !includeGroups.empty() || !excludeGroups.empty();
// early exit if mask and no group logic
if (std::is_same<ValueT, bool>::value && !useGroup) return grid;
// evaluate point group filters to produce a subset of the generated mask
tree::LeafManager<GridTreeT> leafManager(*tree);
if (useGroup) {
// build mask from points in parallel only where filter evaluates to true
const auto leaf = points.constTree().cbeginLeaf();
MultiGroupFilter filter(includeGroups, excludeGroups, leaf->attributeSet());
PointsToScalarOp<GridT, PointDataGridT, MultiGroupFilter> pointsToScalarOp(
points, filter);
tbb::parallel_for(leafManager.leafRange(), pointsToScalarOp);
}
else {
NullFilter filter;
PointsToScalarOp<GridT, PointDataGridT, NullFilter> pointsToScalarOp(
points, filter);
tbb::parallel_for(leafManager.leafRange(), pointsToScalarOp);
}
return grid;
}
template<typename PointDataGridT, typename GridT>
inline typename GridT::Ptr convertPointsToScalar(
const PointDataGridT& points,
const openvdb::math::Transform& transform,
const std::vector<Name>& includeGroups,
const std::vector<Name>& excludeGroups)
{
using point_mask_internal::PointsToTransformedScalarOp;
using point_mask_internal::GridCombinerOp;
using CombinerOpT = GridCombinerOp<GridT>;
using CombinableT = typename GridCombinerOp<GridT>::CombinableT;
// use the simpler method if the requested transform matches the existing one
const openvdb::math::Transform& pointsTransform = points.constTransform();
if (transform == pointsTransform) {
return convertPointsToScalar<PointDataGridT, GridT>(
points, includeGroups, excludeGroups);
}
typename GridT::Ptr grid = GridT::create();
grid->setTransform(transform.copy());
// early exit if no leaves
if (points.constTree().leafCount() == 0) return grid;
// compute mask grids in parallel using new transform
CombinableT combiner;
tree::LeafManager<const typename PointDataGridT::TreeType> leafManager(points.tree());
const bool useGroup = !includeGroups.empty() || !excludeGroups.empty();
if (useGroup) {
const auto leaf = points.constTree().cbeginLeaf();
MultiGroupFilter filter(includeGroups, excludeGroups, leaf->attributeSet());
PointsToTransformedScalarOp<GridT, PointDataGridT, MultiGroupFilter> pointsToScalarOp(
transform, pointsTransform, filter, combiner);
tbb::parallel_for(leafManager.leafRange(), pointsToScalarOp);
}
else {
NullFilter filter;
PointsToTransformedScalarOp<GridT, PointDataGridT, NullFilter> pointsToScalarOp(
transform, pointsTransform, filter, combiner);
tbb::parallel_for(leafManager.leafRange(), pointsToScalarOp);
}
// combine the mask grids into one
CombinerOpT combineOp(*grid);
combiner.combine_each(combineOp);
return grid;
}
} // namespace point_mask_internal
////////////////////////////////////////
template<typename PointDataGridT, typename MaskT>
inline typename std::enable_if<std::is_same<typename MaskT::ValueType, bool>::value,
typename MaskT::Ptr>::type
convertPointsToMask(
const PointDataGridT& points,
const std::vector<Name>& includeGroups,
const std::vector<Name>& excludeGroups)
{
return point_mask_internal::convertPointsToScalar<PointDataGridT, MaskT>(
points, includeGroups, excludeGroups);
}
template<typename PointDataGridT, typename MaskT>
inline typename std::enable_if<std::is_same<typename MaskT::ValueType, bool>::value,
typename MaskT::Ptr>::type
convertPointsToMask(
const PointDataGridT& points,
const openvdb::math::Transform& transform,
const std::vector<Name>& includeGroups,
const std::vector<Name>& excludeGroups)
{
return point_mask_internal::convertPointsToScalar<PointDataGridT, MaskT>(
points, transform, includeGroups, excludeGroups);
}
////////////////////////////////////////
} // namespace points
} // namespace OPENVDB_VERSION_NAME
} // namespace openvdb
#endif // OPENVDB_POINTS_POINT_MASK_HAS_BEEN_INCLUDED
// Copyright (c) 2012-2017 DreamWorks Animation LLC
// All rights reserved. This software is distributed under the
// Mozilla Public License 2.0 ( http://www.mozilla.org/MPL/2.0/ )
|