/usr/include/openvdb/tools/TopologyToLevelSet.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 | ///////////////////////////////////////////////////////////////////////////
//
// 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 TopologyToLevelSet.h
///
/// @brief This tool generates a narrow-band signed distance field / level set
/// from the interface between active and inactive voxels in a vdb grid.
///
/// @par Example:
/// Combine with @c tools::PointsToVolume for fast point cloud to level set conversion.
#ifndef OPENVDB_TOOLS_TOPOLOGY_TO_LEVELSET_HAS_BEEN_INCLUDED
#define OPENVDB_TOOLS_TOPOLOGY_TO_LEVELSET_HAS_BEEN_INCLUDED
#include "LevelSetFilter.h"
#include "Morphology.h" // for erodeVoxels and dilateActiveValues
#include "SignedFloodFill.h"
#include <openvdb/Grid.h>
#include <openvdb/Types.h>
#include <openvdb/math/FiniteDifference.h> // for math::BiasedGradientScheme
#include <openvdb/util/NullInterrupter.h>
#include <tbb/task_group.h>
namespace openvdb {
OPENVDB_USE_VERSION_NAMESPACE
namespace OPENVDB_VERSION_NAME {
namespace tools {
/// @brief Compute the narrow-band signed distance to the interface between
/// active and inactive voxels in the input grid.
///
/// @return A shared pointer to a new sdf / level set grid of type @c float
///
/// @param grid Input grid of arbitrary type whose active voxels are used
/// in constructing the level set.
/// @param halfWidth Half the width of the narrow band in voxel units.
/// @param closingSteps Number of morphological closing steps used to fill gaps
/// in the active voxel region.
/// @param dilation Number of voxels to expand the active voxel region.
/// @param smoothingSteps Number of smoothing interations.
template<typename GridT>
inline typename GridT::template ValueConverter<float>::Type::Ptr
topologyToLevelSet(const GridT& grid, int halfWidth = 3, int closingSteps = 1, int dilation = 0,
int smoothingSteps = 0);
/// @brief Compute the narrow-band signed distance to the interface between
/// active and inactive voxels in the input grid.
///
/// @return A shared pointer to a new sdf / level set grid of type @c float
///
/// @param grid Input grid of arbitrary type whose active voxels are used
/// in constructing the level set.
/// @param halfWidth Half the width of the narrow band in voxel units.
/// @param closingSteps Number of morphological closing steps used to fill gaps
/// in the active voxel region.
/// @param dilation Number of voxels to expand the active voxel region.
/// @param smoothingSteps Number of smoothing interations.
/// @param interrupt Optional object adhering to the util::NullInterrupter interface.
template<typename GridT, typename InterrupterT>
inline typename GridT::template ValueConverter<float>::Type::Ptr
topologyToLevelSet(const GridT& grid, int halfWidth = 3, int closingSteps = 1, int dilation = 0,
int smoothingSteps = 0, InterrupterT* interrupt = NULL);
////////////////////////////////////////
namespace ttls_internal {
template<typename TreeT>
struct DilateOp
{
DilateOp(TreeT& t, int n) : tree(&t), size(n) {}
void operator()() const {
dilateActiveValues( *tree, size, tools::NN_FACE, tools::IGNORE_TILES);
}
TreeT* tree;
const int size;
};
template<typename TreeT>
struct ErodeOp
{
ErodeOp(TreeT& t, int n) : tree(&t), size(n) {}
void operator()() const { erodeVoxels( *tree, size); }
TreeT* tree;
const int size;
};
template<typename TreeType>
struct OffsetAndMinComp
{
typedef typename TreeType::LeafNodeType LeafNodeType;
typedef typename TreeType::ValueType ValueType;
OffsetAndMinComp(std::vector<LeafNodeType*>& lhsNodes, const TreeType& rhsTree, ValueType offset)
: mLhsNodes(lhsNodes.empty() ? NULL : &lhsNodes[0]), mRhsTree(&rhsTree), mOffset(offset)
{
}
void operator()(const tbb::blocked_range<size_t>& range) const
{
typedef typename LeafNodeType::ValueOnIter Iterator;
tree::ValueAccessor<const TreeType> rhsAcc(*mRhsTree);
const ValueType offset = mOffset;
for (size_t n = range.begin(), N = range.end(); n < N; ++n) {
LeafNodeType& lhsNode = *mLhsNodes[n];
const LeafNodeType * rhsNodePt = rhsAcc.probeConstLeaf(lhsNode.origin());
if (!rhsNodePt) continue;
for (Iterator it = lhsNode.beginValueOn(); it; ++it) {
ValueType& val = const_cast<ValueType&>(it.getValue());
val = std::min(val, offset + rhsNodePt->getValue(it.pos()));
}
}
}
private:
LeafNodeType * * const mLhsNodes;
TreeType const * const mRhsTree;
ValueType const mOffset;
}; // struct OffsetAndMinComp
template<typename GridType, typename InterrupterType>
inline void
normalizeLevelSet(GridType& grid, const int halfWidthInVoxels, InterrupterType* interrupt = NULL)
{
LevelSetFilter<GridType, GridType, InterrupterType> filter(grid, interrupt);
filter.setSpatialScheme(math::FIRST_BIAS);
filter.setNormCount(halfWidthInVoxels);
filter.normalize();
filter.prune();
}
template<typename GridType, typename InterrupterType>
inline void
smoothLevelSet(GridType& grid, int iterations, int halfBandWidthInVoxels, InterrupterType* interrupt = NULL)
{
typedef typename GridType::ValueType ValueType;
typedef typename GridType::TreeType TreeType;
typedef typename TreeType::LeafNodeType LeafNodeType;
GridType filterGrid(grid);
LevelSetFilter<GridType, GridType, InterrupterType> filter(filterGrid, interrupt);
filter.setSpatialScheme(math::FIRST_BIAS);
for (int n = 0; n < iterations; ++n) {
if (interrupt && interrupt->wasInterrupted()) break;
filter.mean(1);
}
std::vector<LeafNodeType*> nodes;
grid.tree().getNodes(nodes);
const ValueType offset = ValueType(double(0.5) * grid.transform().voxelSize()[0]);
tbb::parallel_for(tbb::blocked_range<size_t>(0, nodes.size()),
OffsetAndMinComp<TreeType>(nodes, filterGrid.tree(), -offset));
// Clean up any damanage that was done by the min operation
normalizeLevelSet(grid, halfBandWidthInVoxels, interrupt);
}
} // namespace ttls_internal
template<typename GridT, typename InterrupterT>
inline typename GridT::template ValueConverter<float>::Type::Ptr
topologyToLevelSet(const GridT& grid, int halfWidth, int closingSteps, int dilation,
int smoothingSteps, InterrupterT* interrupt)
{
typedef typename GridT::TreeType::template ValueConverter<ValueMask>::Type MaskTreeT;
typedef typename GridT::TreeType::template ValueConverter<float>::Type FloatTreeT;
typedef Grid<FloatTreeT> FloatGridT;
// Check inputs
halfWidth = std::max(halfWidth, 1);
closingSteps = std::max(closingSteps, 0);
dilation = std::max(dilation, 0);
if ( !grid.hasUniformVoxels() ) {
OPENVDB_THROW(ValueError, "Non-uniform voxels are not supported!");
}
// Copy the topology into a MaskGrid.
MaskTreeT maskTree( grid.tree(), false/*background*/, openvdb::TopologyCopy() );
// Morphological closing operation.
dilateActiveValues( maskTree, closingSteps + dilation, tools::NN_FACE, tools::IGNORE_TILES );
erodeVoxels( maskTree, closingSteps );
// Generate a volume with an implicit zero crossing at the boundary
// between active and inactive values in the input grid.
const float background = float(grid.voxelSize()[0]) * float(halfWidth);
typename FloatTreeT::Ptr lsTree(
new FloatTreeT( maskTree, /*out=*/background, /*in=*/-background, openvdb::TopologyCopy() ) );
tbb::task_group pool;
pool.run( ttls_internal::ErodeOp< MaskTreeT >( maskTree, halfWidth ) );
pool.run( ttls_internal::DilateOp<FloatTreeT>( *lsTree , halfWidth ) );
pool.wait();// wait for both tasks to complete
lsTree->topologyDifference( maskTree );
tools::pruneLevelSet( *lsTree, /*threading=*/true);
// Create a level set grid from the tree
typename FloatGridT::Ptr lsGrid = FloatGridT::create( lsTree );
lsGrid->setTransform( grid.transform().copy() );
lsGrid->setGridClass( openvdb::GRID_LEVEL_SET );
// Use a PDE based scheme to propagate distance values from the
// implicit zero crossing.
ttls_internal::normalizeLevelSet(*lsGrid, 3*halfWidth, interrupt);
// Additional filtering
if (smoothingSteps > 0) {
ttls_internal::smoothLevelSet(*lsGrid, smoothingSteps, halfWidth, interrupt);
}
return lsGrid;
}
template<typename GridT>
inline typename GridT::template ValueConverter<float>::Type::Ptr
topologyToLevelSet(const GridT& grid, int halfWidth, int closingSteps, int dilation, int smoothingSteps)
{
util::NullInterrupter interrupt;
return topologyToLevelSet(grid, halfWidth, closingSteps, dilation, smoothingSteps, &interrupt);
}
} // namespace tools
} // namespace OPENVDB_VERSION_NAME
} // namespace openvdb
#endif // OPENVDB_TOOLS_TOPOLOGY_TO_LEVELSET_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/ )
|