16 #ifndef OPENVDB_TOOLS_MESH_TO_VOLUME_HAS_BEEN_INCLUDED
17 #define OPENVDB_TOOLS_MESH_TO_VOLUME_HAS_BEEN_INCLUDED
30 #include <tbb/blocked_range.h>
31 #include <tbb/enumerable_thread_specific.h>
32 #include <tbb/parallel_for.h>
33 #include <tbb/parallel_reduce.h>
34 #include <tbb/partitioner.h>
35 #include <tbb/task_group.h>
36 #include <tbb/task_scheduler_init.h>
44 #include <type_traits>
109 template <
typename Gr
idType,
typename MeshDataAdapter>
110 inline typename GridType::Ptr
114 float exteriorBandWidth = 3.0f,
115 float interiorBandWidth = 3.0f,
135 template <
typename Gr
idType,
typename MeshDataAdapter,
typename Interrupter>
136 inline typename GridType::Ptr
138 Interrupter& interrupter,
141 float exteriorBandWidth = 3.0f,
142 float interiorBandWidth = 3.0f,
160 template<
typename Po
intType,
typename PolygonType>
164 const std::vector<PolygonType>& polygons)
165 : mPointArray(points.empty() ? nullptr : &points[0])
166 , mPointArraySize(points.size())
167 , mPolygonArray(polygons.empty() ? nullptr : &polygons[0])
168 , mPolygonArraySize(polygons.size())
173 const PolygonType* polygonArray,
size_t polygonArraySize)
174 : mPointArray(pointArray)
175 , mPointArraySize(pointArraySize)
176 , mPolygonArray(polygonArray)
177 , mPolygonArraySize(polygonArraySize)
186 return (PolygonType::size == 3 || mPolygonArray[n][3] ==
util::INVALID_IDX) ? 3 : 4;
192 const PointType& p = mPointArray[mPolygonArray[n][int(v)]];
193 pos[0] = double(p[0]);
194 pos[1] = double(p[1]);
195 pos[2] = double(p[2]);
199 PointType
const *
const mPointArray;
200 size_t const mPointArraySize;
201 PolygonType
const *
const mPolygonArray;
202 size_t const mPolygonArraySize;
230 template<
typename Gr
idType>
231 inline typename GridType::Ptr
233 const openvdb::math::Transform& xform,
234 const std::vector<Vec3s>& points,
235 const std::vector<Vec3I>& triangles,
239 template<
typename Gr
idType,
typename Interrupter>
240 inline typename GridType::Ptr
242 Interrupter& interrupter,
243 const openvdb::math::Transform& xform,
244 const std::vector<Vec3s>& points,
245 const std::vector<Vec3I>& triangles,
264 template<
typename Gr
idType>
265 inline typename GridType::Ptr
267 const openvdb::math::Transform& xform,
268 const std::vector<Vec3s>& points,
269 const std::vector<Vec4I>& quads,
273 template<
typename Gr
idType,
typename Interrupter>
274 inline typename GridType::Ptr
276 Interrupter& interrupter,
277 const openvdb::math::Transform& xform,
278 const std::vector<Vec3s>& points,
279 const std::vector<Vec4I>& quads,
299 template<
typename Gr
idType>
300 inline typename GridType::Ptr
302 const openvdb::math::Transform& xform,
303 const std::vector<Vec3s>& points,
304 const std::vector<Vec3I>& triangles,
305 const std::vector<Vec4I>& quads,
309 template<
typename Gr
idType,
typename Interrupter>
310 inline typename GridType::Ptr
312 Interrupter& interrupter,
313 const openvdb::math::Transform& xform,
314 const std::vector<Vec3s>& points,
315 const std::vector<Vec3I>& triangles,
316 const std::vector<Vec4I>& quads,
338 template<
typename Gr
idType>
339 inline typename GridType::Ptr
341 const openvdb::math::Transform& xform,
342 const std::vector<Vec3s>& points,
343 const std::vector<Vec3I>& triangles,
344 const std::vector<Vec4I>& quads,
349 template<
typename Gr
idType,
typename Interrupter>
350 inline typename GridType::Ptr
352 Interrupter& interrupter,
353 const openvdb::math::Transform& xform,
354 const std::vector<Vec3s>& points,
355 const std::vector<Vec3I>& triangles,
356 const std::vector<Vec4I>& quads,
375 template<
typename Gr
idType>
376 inline typename GridType::Ptr
378 const openvdb::math::Transform& xform,
379 const std::vector<Vec3s>& points,
380 const std::vector<Vec3I>& triangles,
381 const std::vector<Vec4I>& quads,
385 template<
typename Gr
idType,
typename Interrupter>
386 inline typename GridType::Ptr
388 Interrupter& interrupter,
389 const openvdb::math::Transform& xform,
390 const std::vector<Vec3s>& points,
391 const std::vector<Vec3I>& triangles,
392 const std::vector<Vec4I>& quads,
405 template<
typename Gr
idType,
typename VecType>
406 inline typename GridType::Ptr
408 const openvdb::math::Transform& xform,
421 template <
typename FloatTreeT>
439 : mXDist(dist), mYDist(dist), mZDist(dist)
482 void convert(
const std::vector<Vec3s>& pointList,
const std::vector<Vec4I>& polygonList);
488 std::vector<Vec3d>& points, std::vector<Index32>& primitives);
507 namespace mesh_to_volume_internal {
509 template<
typename Po
intType>
514 : mPointsIn(pointsIn), mPointsOut(pointsOut), mXform(&xform)
518 void operator()(
const tbb::blocked_range<size_t>& range)
const {
522 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
524 const PointType& wsP = mPointsIn[n];
525 pos[0] = double(wsP[0]);
526 pos[1] = double(wsP[1]);
527 pos[2] = double(wsP[2]);
529 pos = mXform->worldToIndex(pos);
531 PointType& isP = mPointsOut[n];
532 isP[0] =
typename PointType::value_type(pos[0]);
533 isP[1] =
typename PointType::value_type(pos[1]);
534 isP[2] =
typename PointType::value_type(pos[2]);
544 template<
typename ValueType>
547 static ValueType
epsilon() {
return ValueType(1e-7); }
555 template<
typename TreeType>
567 : mDistTree(&lhsDistTree)
568 , mIdxTree(&lhsIdxTree)
569 , mRhsDistNodes(rhsDistNodes)
570 , mRhsIdxNodes(rhsIdxNodes)
574 void operator()(
const tbb::blocked_range<size_t>& range)
const {
579 using DistValueType =
typename LeafNodeType::ValueType;
580 using IndexValueType =
typename Int32LeafNodeType::ValueType;
582 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
584 const Coord& origin = mRhsDistNodes[n]->origin();
589 DistValueType* lhsDistData = lhsDistNode->buffer().data();
590 IndexValueType* lhsIdxData = lhsIdxNode->buffer().data();
592 const DistValueType* rhsDistData = mRhsDistNodes[n]->buffer().data();
593 const IndexValueType* rhsIdxData = mRhsIdxNodes[n]->buffer().data();
596 for (
Index32 offset = 0; offset < LeafNodeType::SIZE; ++offset) {
600 const DistValueType& lhsValue = lhsDistData[offset];
601 const DistValueType& rhsValue = rhsDistData[offset];
603 if (rhsValue < lhsValue) {
604 lhsDistNode->setValueOn(offset, rhsValue);
605 lhsIdxNode->setValueOn(offset, rhsIdxData[offset]);
607 lhsIdxNode->setValueOn(offset,
608 std::min(lhsIdxData[offset], rhsIdxData[offset]));
613 delete mRhsDistNodes[n];
614 delete mRhsIdxNodes[n];
620 TreeType *
const mDistTree;
621 Int32TreeType *
const mIdxTree;
623 LeafNodeType **
const mRhsDistNodes;
624 Int32LeafNodeType **
const mRhsIdxNodes;
631 template<
typename TreeType>
637 : mNodes(nodes.empty() ? nullptr : &nodes[0]), mCoordinates(coordinates)
641 void operator()(
const tbb::blocked_range<size_t>& range)
const {
642 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
643 Coord& origin =
const_cast<Coord&
>(mNodes[n]->origin());
644 mCoordinates[n] = origin;
645 origin[0] =
static_cast<int>(n);
654 template<
typename TreeType>
660 : mNodes(nodes.empty() ? nullptr : &nodes[0]), mCoordinates(coordinates)
664 void operator()(
const tbb::blocked_range<size_t>& range)
const {
665 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
666 Coord& origin =
const_cast<Coord&
>(mNodes[n]->origin());
667 origin[0] = mCoordinates[n][0];
676 template<
typename TreeType>
683 size_t* offsets,
size_t numNodes,
const CoordBBox& bbox)
685 , mCoordinates(coordinates)
687 , mNumNodes(numNodes)
697 void operator()(
const tbb::blocked_range<size_t>& range)
const {
699 size_t* offsetsNextX = mOffsets;
700 size_t* offsetsPrevX = mOffsets + mNumNodes;
701 size_t* offsetsNextY = mOffsets + mNumNodes * 2;
702 size_t* offsetsPrevY = mOffsets + mNumNodes * 3;
703 size_t* offsetsNextZ = mOffsets + mNumNodes * 4;
704 size_t* offsetsPrevZ = mOffsets + mNumNodes * 5;
708 const Int32 DIM =
static_cast<Int32>(LeafNodeType::DIM);
710 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
711 const Coord& origin = mCoordinates[n];
712 offsetsNextX[n] = findNeighbourNode(acc, origin,
Coord(DIM, 0, 0));
713 offsetsPrevX[n] = findNeighbourNode(acc, origin,
Coord(-DIM, 0, 0));
714 offsetsNextY[n] = findNeighbourNode(acc, origin,
Coord(0, DIM, 0));
715 offsetsPrevY[n] = findNeighbourNode(acc, origin,
Coord(0, -DIM, 0));
716 offsetsNextZ[n] = findNeighbourNode(acc, origin,
Coord(0, 0, DIM));
717 offsetsPrevZ[n] = findNeighbourNode(acc, origin,
Coord(0, 0, -DIM));
724 Coord ijk = start + step;
729 if (node)
return static_cast<size_t>(node->origin()[0]);
738 TreeType
const *
const mTree;
739 Coord const *
const mCoordinates;
740 size_t *
const mOffsets;
742 const size_t mNumNodes;
747 template<
typename TreeType>
756 mLeafNodes.reserve(tree.leafCount());
757 tree.getNodes(mLeafNodes);
759 if (mLeafNodes.empty())
return;
762 tree.evalLeafBoundingBox(bbox);
764 const tbb::blocked_range<size_t> range(0, mLeafNodes.size());
768 std::unique_ptr<Coord[]> coordinates{
new Coord[mLeafNodes.size()]};
769 tbb::parallel_for(range,
773 mOffsets.reset(
new size_t[mLeafNodes.size() * 6]);
777 tree, coordinates.get(), mOffsets.get(), mLeafNodes.size(), bbox));
783 size_t size()
const {
return mLeafNodes.size(); }
785 std::vector<LeafNodeType*>&
nodes() {
return mLeafNodes; }
786 const std::vector<LeafNodeType*>&
nodes()
const {
return mLeafNodes; }
790 const size_t*
offsetsPrevX()
const {
return mOffsets.get() + mLeafNodes.size(); }
792 const size_t*
offsetsNextY()
const {
return mOffsets.get() + mLeafNodes.size() * 2; }
793 const size_t*
offsetsPrevY()
const {
return mOffsets.get() + mLeafNodes.size() * 3; }
795 const size_t*
offsetsNextZ()
const {
return mOffsets.get() + mLeafNodes.size() * 4; }
796 const size_t*
offsetsPrevZ()
const {
return mOffsets.get() + mLeafNodes.size() * 5; }
799 std::vector<LeafNodeType*> mLeafNodes;
800 std::unique_ptr<size_t[]> mOffsets;
804 template<
typename TreeType>
817 : mStartNodeIndices(startNodeIndices.empty() ? nullptr : &startNodeIndices[0])
818 , mConnectivity(&connectivity)
823 void operator()(
const tbb::blocked_range<size_t>& range)
const {
825 constexpr
Int32 DIM =
static_cast<Int32>(LeafNodeType::DIM);
827 std::vector<LeafNodeType*>& nodes = mConnectivity->nodes();
830 size_t idxA = 0, idxB = 1;
833 const size_t* nextOffsets = mConnectivity->offsetsNextZ();
834 const size_t* prevOffsets = mConnectivity->offsetsPrevZ();
842 nextOffsets = mConnectivity->offsetsNextY();
843 prevOffsets = mConnectivity->offsetsPrevY();
845 }
else if (mAxis ==
X_AXIS) {
851 nextOffsets = mConnectivity->offsetsNextX();
852 prevOffsets = mConnectivity->offsetsPrevX();
857 Int32& a = ijk[idxA];
858 Int32& b = ijk[idxB];
860 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
862 size_t startOffset = mStartNodeIndices[n];
863 size_t lastOffset = startOffset;
867 for (a = 0; a < DIM; ++a) {
868 for (b = 0; b < DIM; ++b) {
870 pos =
static_cast<Int32>(LeafNodeType::coordToOffset(ijk));
871 size_t offset = startOffset;
874 while ( offset != ConnectivityTable::INVALID_OFFSET &&
875 traceVoxelLine(*nodes[offset], pos, step) ) {
878 offset = nextOffsets[offset];
883 while (offset != ConnectivityTable::INVALID_OFFSET) {
885 offset = nextOffsets[offset];
890 pos += step * (DIM - 1);
891 while ( offset != ConnectivityTable::INVALID_OFFSET &&
892 traceVoxelLine(*nodes[offset], pos, -step)) {
893 offset = prevOffsets[offset];
905 bool isOutside =
true;
907 for (
Index i = 0; i < LeafNodeType::DIM; ++i) {
916 if (!(dist >
ValueType(0.75))) isOutside =
false;
929 size_t const *
const mStartNodeIndices;
930 ConnectivityTable *
const mConnectivity;
936 template<
typename LeafNodeType>
940 using ValueType =
typename LeafNodeType::ValueType;
941 using Queue = std::deque<Index>;
944 ValueType* data = node.buffer().data();
948 for (
Index pos = 0; pos < LeafNodeType::SIZE; ++pos) {
949 if (data[pos] < 0.0) seedPoints.push_back(pos);
952 if (seedPoints.empty())
return;
955 for (Queue::iterator it = seedPoints.begin(); it != seedPoints.end(); ++it) {
956 ValueType& dist = data[*it];
963 Index pos(0), nextPos(0);
965 while (!seedPoints.empty()) {
967 pos = seedPoints.back();
968 seedPoints.pop_back();
970 ValueType& dist = data[pos];
972 if (!(dist < ValueType(0.0))) {
976 ijk = LeafNodeType::offsetToLocalCoord(pos);
979 nextPos = pos - LeafNodeType::DIM * LeafNodeType::DIM;
980 if (data[nextPos] > ValueType(0.75)) seedPoints.push_back(nextPos);
983 if (ijk[0] != (LeafNodeType::DIM - 1)) {
984 nextPos = pos + LeafNodeType::DIM * LeafNodeType::DIM;
985 if (data[nextPos] > ValueType(0.75)) seedPoints.push_back(nextPos);
989 nextPos = pos - LeafNodeType::DIM;
990 if (data[nextPos] > ValueType(0.75)) seedPoints.push_back(nextPos);
993 if (ijk[1] != (LeafNodeType::DIM - 1)) {
994 nextPos = pos + LeafNodeType::DIM;
995 if (data[nextPos] > ValueType(0.75)) seedPoints.push_back(nextPos);
1000 if (data[nextPos] > ValueType(0.75)) seedPoints.push_back(nextPos);
1003 if (ijk[2] != (LeafNodeType::DIM - 1)) {
1005 if (data[nextPos] > ValueType(0.75)) seedPoints.push_back(nextPos);
1012 template<
typename LeafNodeType>
1016 bool updatedNode =
false;
1018 using ValueType =
typename LeafNodeType::ValueType;
1019 ValueType* data = node.buffer().data();
1023 bool updatedSign =
true;
1024 while (updatedSign) {
1026 updatedSign =
false;
1028 for (
Index pos = 0; pos < LeafNodeType::SIZE; ++pos) {
1030 ValueType& dist = data[pos];
1032 if (!(dist < ValueType(0.0)) && dist > ValueType(0.75)) {
1034 ijk = LeafNodeType::offsetToLocalCoord(pos);
1037 if (ijk[2] != 0 && data[pos - 1] < ValueType(0.0)) {
1039 dist = ValueType(-dist);
1042 }
else if (ijk[2] != (LeafNodeType::DIM - 1) && data[pos + 1] < ValueType(0.0)) {
1044 dist = ValueType(-dist);
1047 }
else if (ijk[1] != 0 && data[pos - LeafNodeType::DIM] < ValueType(0.0)) {
1049 dist = ValueType(-dist);
1052 }
else if (ijk[1] != (LeafNodeType::DIM - 1)
1053 && data[pos + LeafNodeType::DIM] < ValueType(0.0))
1056 dist = ValueType(-dist);
1059 }
else if (ijk[0] != 0
1060 && data[pos - LeafNodeType::DIM * LeafNodeType::DIM] < ValueType(0.0))
1063 dist = ValueType(-dist);
1066 }
else if (ijk[0] != (LeafNodeType::DIM - 1)
1067 && data[pos + LeafNodeType::DIM * LeafNodeType::DIM] < ValueType(0.0))
1070 dist = ValueType(-dist);
1075 updatedNode |= updatedSign;
1082 template<
typename TreeType>
1090 : mNodes(nodes.empty() ? nullptr : &nodes[0])
1091 , mChangedNodeMask(changedNodeMask)
1096 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
1097 if (mChangedNodeMask[n]) {
1113 template<
typename ValueType>
1116 FillArray(ValueType* array,
const ValueType v) : mArray(array), mValue(v) { }
1119 const ValueType v = mValue;
1120 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
1130 template<
typename ValueType>
1132 fillArray(ValueType* array,
const ValueType val,
const size_t length)
1134 const auto grainSize = std::max<size_t>(
1135 length / tbb::task_scheduler_init::default_num_threads(), 1024);
1136 const tbb::blocked_range<size_t> range(0, length, grainSize);
1141 template<
typename TreeType>
1149 const bool* changedNodeMask,
bool* changedVoxelMask)
1150 : mNodes(nodes.empty() ? nullptr : &nodes[0])
1151 , mChangedNodeMask(changedNodeMask)
1152 , mChangedVoxelMask(changedVoxelMask)
1157 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
1159 if (mChangedNodeMask[n]) {
1160 bool* mask = &mChangedVoxelMask[n * LeafNodeType::SIZE];
1162 ValueType* data = mNodes[n]->buffer().data();
1164 for (
Index pos = 0; pos < LeafNodeType::SIZE; ++pos) {
1180 template<
typename TreeType>
1189 bool* changedNodeMask,
bool* nodeMask,
bool* changedVoxelMask)
1190 : mConnectivity(&connectivity)
1191 , mChangedNodeMask(changedNodeMask)
1192 , mNodeMask(nodeMask)
1193 , mChangedVoxelMask(changedVoxelMask)
1199 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
1200 bool changedValue =
false;
1202 changedValue |= processZ(n,
true);
1203 changedValue |= processZ(n,
false);
1205 changedValue |= processY(n,
true);
1206 changedValue |= processY(n,
false);
1208 changedValue |= processX(n,
true);
1209 changedValue |= processX(n,
false);
1211 mNodeMask[n] = changedValue;
1218 const size_t offset =
1219 firstFace ? mConnectivity->offsetsPrevZ()[n] : mConnectivity->offsetsNextZ()[n];
1220 if (offset != ConnectivityTable::INVALID_OFFSET && mChangedNodeMask[offset]) {
1222 bool* mask = &mChangedVoxelMask[n * LeafNodeType::SIZE];
1224 const ValueType* lhsData = mConnectivity->nodes()[n]->buffer().data();
1225 const ValueType* rhsData = mConnectivity->nodes()[offset]->buffer().data();
1227 const Index lastOffset = LeafNodeType::DIM - 1;
1228 const Index lhsOffset =
1229 firstFace ? 0 : lastOffset, rhsOffset = firstFace ? lastOffset : 0;
1231 Index tmpPos(0), pos(0);
1232 bool changedValue =
false;
1234 for (
Index x = 0; x < LeafNodeType::DIM; ++x) {
1235 tmpPos = x << (2 * LeafNodeType::LOG2DIM);
1236 for (
Index y = 0; y < LeafNodeType::DIM; ++y) {
1237 pos = tmpPos + (y << LeafNodeType::LOG2DIM);
1239 if (lhsData[pos + lhsOffset] >
ValueType(0.75)) {
1240 if (rhsData[pos + rhsOffset] <
ValueType(0.0)) {
1241 changedValue =
true;
1242 mask[pos + lhsOffset] =
true;
1248 return changedValue;
1256 const size_t offset =
1257 firstFace ? mConnectivity->offsetsPrevY()[n] : mConnectivity->offsetsNextY()[n];
1258 if (offset != ConnectivityTable::INVALID_OFFSET && mChangedNodeMask[offset]) {
1260 bool* mask = &mChangedVoxelMask[n * LeafNodeType::SIZE];
1262 const ValueType* lhsData = mConnectivity->nodes()[n]->buffer().data();
1263 const ValueType* rhsData = mConnectivity->nodes()[offset]->buffer().data();
1265 const Index lastOffset = LeafNodeType::DIM * (LeafNodeType::DIM - 1);
1266 const Index lhsOffset =
1267 firstFace ? 0 : lastOffset, rhsOffset = firstFace ? lastOffset : 0;
1269 Index tmpPos(0), pos(0);
1270 bool changedValue =
false;
1272 for (
Index x = 0; x < LeafNodeType::DIM; ++x) {
1273 tmpPos = x << (2 * LeafNodeType::LOG2DIM);
1274 for (
Index z = 0; z < LeafNodeType::DIM; ++z) {
1277 if (lhsData[pos + lhsOffset] >
ValueType(0.75)) {
1278 if (rhsData[pos + rhsOffset] <
ValueType(0.0)) {
1279 changedValue =
true;
1280 mask[pos + lhsOffset] =
true;
1286 return changedValue;
1294 const size_t offset =
1295 firstFace ? mConnectivity->offsetsPrevX()[n] : mConnectivity->offsetsNextX()[n];
1296 if (offset != ConnectivityTable::INVALID_OFFSET && mChangedNodeMask[offset]) {
1298 bool* mask = &mChangedVoxelMask[n * LeafNodeType::SIZE];
1300 const ValueType* lhsData = mConnectivity->nodes()[n]->buffer().data();
1301 const ValueType* rhsData = mConnectivity->nodes()[offset]->buffer().data();
1303 const Index lastOffset = LeafNodeType::DIM * LeafNodeType::DIM * (LeafNodeType::DIM-1);
1304 const Index lhsOffset =
1305 firstFace ? 0 : lastOffset, rhsOffset = firstFace ? lastOffset : 0;
1307 Index tmpPos(0), pos(0);
1308 bool changedValue =
false;
1310 for (
Index y = 0; y < LeafNodeType::DIM; ++y) {
1311 tmpPos = y << LeafNodeType::LOG2DIM;
1312 for (
Index z = 0; z < LeafNodeType::DIM; ++z) {
1315 if (lhsData[pos + lhsOffset] >
ValueType(0.75)) {
1316 if (rhsData[pos + rhsOffset] <
ValueType(0.0)) {
1317 changedValue =
true;
1318 mask[pos + lhsOffset] =
true;
1324 return changedValue;
1339 template<
typename TreeType,
typename MeshDataAdapter>
1353 std::vector<LeafNodeType*>& distNodes,
1354 const TreeType& distTree,
1357 : mDistNodes(distNodes.empty() ? nullptr : &distNodes[0])
1358 , mDistTree(&distTree)
1359 , mIndexTree(&indexTree)
1373 Index xPos(0), yPos(0);
1374 Coord ijk, nijk, nodeMin, nodeMax;
1375 Vec3d cp, xyz, nxyz, dir1, dir2;
1377 LocalData& localData = mLocalDataTable->local();
1380 if (!points) points.reset(
new Vec3d[LeafNodeType::SIZE * 2]);
1383 if (!mask) mask.reset(
new bool[LeafNodeType::SIZE]);
1386 typename LeafNodeType::ValueOnCIter it;
1388 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
1394 const Int32* idxData = idxNode->buffer().data();
1396 nodeMin = node.origin();
1397 nodeMax = nodeMin.
offsetBy(LeafNodeType::DIM - 1);
1400 memset(mask.get(), 0,
sizeof(
bool) * LeafNodeType::SIZE);
1402 for (it = node.cbeginValueOn(); it; ++it) {
1403 Index pos = it.pos();
1406 if (dist < 0.0 || dist > 0.75)
continue;
1408 ijk = node.offsetToGlobalCoord(pos);
1410 xyz[0] = double(ijk[0]);
1411 xyz[1] = double(ijk[1]);
1412 xyz[2] = double(ijk[2]);
1418 bool flipSign =
false;
1420 for (nijk[0] = bbox.
min()[0]; nijk[0] <= bbox.
max()[0] && !flipSign; ++nijk[0]) {
1421 xPos = (nijk[0] & (LeafNodeType::DIM - 1u)) << (2 * LeafNodeType::LOG2DIM);
1422 for (nijk[1]=bbox.
min()[1]; nijk[1] <= bbox.
max()[1] && !flipSign; ++nijk[1]) {
1423 yPos = xPos + ((nijk[1] & (LeafNodeType::DIM-1u)) << LeafNodeType::LOG2DIM);
1424 for (nijk[2] = bbox.
min()[2]; nijk[2] <= bbox.
max()[2]; ++nijk[2]) {
1425 pos = yPos + (nijk[2] & (LeafNodeType::DIM - 1u));
1427 const Int32& polyIdx = idxData[pos];
1432 const Index pointIndex = pos * 2;
1438 nxyz[0] = double(nijk[0]);
1439 nxyz[1] = double(nijk[1]);
1440 nxyz[2] = double(nijk[2]);
1442 Vec3d& point = points[pointIndex];
1444 point = closestPoint(nxyz, polyIdx);
1446 Vec3d& direction = points[pointIndex + 1];
1447 direction = nxyz - point;
1448 direction.normalize();
1451 dir1 = xyz - points[pointIndex];
1454 if (points[pointIndex + 1].dot(dir1) > 0.0) {
1465 for (
Int32 m = 0; m < 26; ++m) {
1469 nxyz[0] = double(nijk[0]);
1470 nxyz[1] = double(nijk[1]);
1471 nxyz[2] = double(nijk[2]);
1473 cp = closestPoint(nxyz, idxAcc.
getValue(nijk));
1481 if (dir2.dot(dir1) > 0.0) {
1497 Vec3d a, b, c, cp, uvw;
1499 const size_t polygon = size_t(polyIdx);
1500 mMesh->getIndexSpacePoint(polygon, 0, a);
1501 mMesh->getIndexSpacePoint(polygon, 1, b);
1502 mMesh->getIndexSpacePoint(polygon, 2, c);
1506 if (4 == mMesh->vertexCount(polygon)) {
1508 mMesh->getIndexSpacePoint(polygon, 3, b);
1512 if ((center - c).lengthSqr() < (center - cp).lengthSqr()) {
1521 LeafNodeType **
const mDistNodes;
1522 TreeType
const *
const mDistTree;
1523 Int32TreeType
const *
const mIndexTree;
1526 SharedPtr<LocalDataTable> mLocalDataTable;
1533 template<
typename LeafNodeType>
1537 using NodeT = LeafNodeType;
1539 const Coord ijk = NodeT::offsetToLocalCoord(pos);
1543 mask[0] = ijk[0] != (NodeT::DIM - 1);
1545 mask[1] = ijk[0] != 0;
1547 mask[2] = ijk[1] != (NodeT::DIM - 1);
1549 mask[3] = ijk[1] != 0;
1551 mask[4] = ijk[2] != (NodeT::DIM - 1);
1553 mask[5] = ijk[2] != 0;
1557 mask[6] = mask[0] && mask[5];
1559 mask[7] = mask[1] && mask[5];
1561 mask[8] = mask[0] && mask[4];
1563 mask[9] = mask[1] && mask[4];
1565 mask[10] = mask[0] && mask[2];
1567 mask[11] = mask[1] && mask[2];
1569 mask[12] = mask[0] && mask[3];
1571 mask[13] = mask[1] && mask[3];
1573 mask[14] = mask[3] && mask[4];
1575 mask[15] = mask[3] && mask[5];
1577 mask[16] = mask[2] && mask[4];
1579 mask[17] = mask[2] && mask[5];
1583 mask[18] = mask[1] && mask[3] && mask[5];
1585 mask[19] = mask[1] && mask[3] && mask[4];
1587 mask[20] = mask[0] && mask[3] && mask[4];
1589 mask[21] = mask[0] && mask[3] && mask[5];
1591 mask[22] = mask[1] && mask[2] && mask[5];
1593 mask[23] = mask[1] && mask[2] && mask[4];
1595 mask[24] = mask[0] && mask[2] && mask[4];
1597 mask[25] = mask[0] && mask[2] && mask[5];
1601 template<
typename Compare,
typename LeafNodeType>
1605 using NodeT = LeafNodeType;
1608 if (mask[5] && Compare::check(data[pos - 1]))
return true;
1610 if (mask[4] && Compare::check(data[pos + 1]))
return true;
1612 if (mask[3] && Compare::check(data[pos - NodeT::DIM]))
return true;
1614 if (mask[2] && Compare::check(data[pos + NodeT::DIM]))
return true;
1616 if (mask[1] && Compare::check(data[pos - NodeT::DIM * NodeT::DIM]))
return true;
1618 if (mask[0] && Compare::check(data[pos + NodeT::DIM * NodeT::DIM]))
return true;
1620 if (mask[6] && Compare::check(data[pos + NodeT::DIM * NodeT::DIM]))
return true;
1622 if (mask[7] && Compare::check(data[pos - NodeT::DIM * NodeT::DIM - 1]))
return true;
1624 if (mask[8] && Compare::check(data[pos + NodeT::DIM * NodeT::DIM + 1]))
return true;
1626 if (mask[9] && Compare::check(data[pos - NodeT::DIM * NodeT::DIM + 1]))
return true;
1628 if (mask[10] && Compare::check(data[pos + NodeT::DIM * NodeT::DIM + NodeT::DIM]))
return true;
1630 if (mask[11] && Compare::check(data[pos - NodeT::DIM * NodeT::DIM + NodeT::DIM]))
return true;
1632 if (mask[12] && Compare::check(data[pos + NodeT::DIM * NodeT::DIM - NodeT::DIM]))
return true;
1634 if (mask[13] && Compare::check(data[pos - NodeT::DIM * NodeT::DIM - NodeT::DIM]))
return true;
1636 if (mask[14] && Compare::check(data[pos - NodeT::DIM + 1]))
return true;
1638 if (mask[15] && Compare::check(data[pos - NodeT::DIM - 1]))
return true;
1640 if (mask[16] && Compare::check(data[pos + NodeT::DIM + 1]))
return true;
1642 if (mask[17] && Compare::check(data[pos + NodeT::DIM - 1]))
return true;
1644 if (mask[18] && Compare::check(data[pos - NodeT::DIM * NodeT::DIM - NodeT::DIM - 1]))
return true;
1646 if (mask[19] && Compare::check(data[pos - NodeT::DIM * NodeT::DIM - NodeT::DIM + 1]))
return true;
1648 if (mask[20] && Compare::check(data[pos + NodeT::DIM * NodeT::DIM - NodeT::DIM + 1]))
return true;
1650 if (mask[21] && Compare::check(data[pos + NodeT::DIM * NodeT::DIM - NodeT::DIM - 1]))
return true;
1652 if (mask[22] && Compare::check(data[pos - NodeT::DIM * NodeT::DIM + NodeT::DIM - 1]))
return true;
1654 if (mask[23] && Compare::check(data[pos - NodeT::DIM * NodeT::DIM + NodeT::DIM + 1]))
return true;
1656 if (mask[24] && Compare::check(data[pos + NodeT::DIM * NodeT::DIM + NodeT::DIM + 1]))
return true;
1658 if (mask[25] && Compare::check(data[pos + NodeT::DIM * NodeT::DIM + NodeT::DIM - 1]))
return true;
1664 template<
typename Compare,
typename AccessorType>
1668 for (
Int32 m = 0; m < 26; ++m) {
1678 template<
typename TreeType>
1688 , mNodes(nodes.empty() ? nullptr : &nodes[0])
1695 bool neighbourMask[26];
1697 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
1702 typename LeafNodeType::ValueOnCIter it;
1703 for (it = node.cbeginValueOn(); it; ++it) {
1705 const Index pos = it.pos();
1708 if (dist < 0.0 || dist > 0.75)
continue;
1711 maskNodeInternalNeighbours<LeafNodeType>(pos, neighbourMask);
1713 const bool hasNegativeNeighbour =
1714 checkNeighbours<IsNegative, LeafNodeType>(pos, data, neighbourMask) ||
1715 checkNeighbours<IsNegative>(node.offsetToGlobalCoord(pos), acc, neighbourMask);
1717 if (!hasNegativeNeighbour) {
1730 template<
typename TreeType>
1741 : mNodes(nodes.empty() ? nullptr : &nodes[0])
1742 , mDistTree(&distTree)
1743 , mIndexTree(&indexTree)
1751 bool neighbourMask[26];
1753 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
1756 ValueType* data = distNode.buffer().data();
1758 typename Int32TreeType::LeafNodeType* idxNode =
1761 typename LeafNodeType::ValueOnCIter it;
1762 for (it = distNode.cbeginValueOn(); it; ++it) {
1764 const Index pos = it.pos();
1766 if (!(data[pos] > 0.75))
continue;
1769 maskNodeInternalNeighbours<LeafNodeType>(pos, neighbourMask);
1771 const bool hasBoundaryNeighbour =
1772 checkNeighbours<Comp, LeafNodeType>(pos, data, neighbourMask) ||
1773 checkNeighbours<Comp>(distNode.offsetToGlobalCoord(pos),distAcc,neighbourMask);
1775 if (!hasBoundaryNeighbour) {
1776 distNode.setValueOff(pos);
1777 idxNode->setValueOff(pos);
1792 template<
typename NodeType>
1799 using NodeMaskType =
typename NodeType::NodeMaskType;
1801 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
1802 const_cast<NodeMaskType&
>(mNodes[n]->getChildMask()).setOff();
1810 template<
typename TreeType>
1814 using RootNodeType =
typename TreeType::RootNodeType;
1815 using NodeChainType =
typename RootNodeType::NodeChainType;
1816 using InternalNodeType =
typename NodeChainType::template Get<1>;
1818 std::vector<InternalNodeType*> nodes;
1819 tree.getNodes(nodes);
1821 tbb::parallel_for(tbb::blocked_range<size_t>(0, nodes.size()),
1826 template<
typename TreeType>
1832 std::vector<LeafNodeType*>& overlappingNodes)
1833 : mLhsTree(&lhsTree)
1834 , mRhsTree(&rhsTree)
1835 , mNodes(&overlappingNodes)
1841 std::vector<LeafNodeType*> rhsLeafNodes;
1843 rhsLeafNodes.reserve(mRhsTree->leafCount());
1846 mRhsTree->stealNodes(rhsLeafNodes);
1850 for (
size_t n = 0, N = rhsLeafNodes.size(); n < N; ++n) {
1851 if (!acc.
probeLeaf(rhsLeafNodes[n]->origin())) {
1854 mNodes->push_back(rhsLeafNodes[n]);
1860 TreeType *
const mLhsTree;
1861 TreeType *
const mRhsTree;
1862 std::vector<LeafNodeType*> *
const mNodes;
1866 template<
typename DistTreeType,
typename IndexTreeType>
1869 DistTreeType& rhsDist, IndexTreeType& rhsIdx)
1871 using DistLeafNodeType =
typename DistTreeType::LeafNodeType;
1872 using IndexLeafNodeType =
typename IndexTreeType::LeafNodeType;
1874 std::vector<DistLeafNodeType*> overlappingDistNodes;
1875 std::vector<IndexLeafNodeType*> overlappingIdxNodes;
1878 tbb::task_group tasks;
1884 if (!overlappingDistNodes.empty() && !overlappingIdxNodes.empty()) {
1885 tbb::parallel_for(tbb::blocked_range<size_t>(0, overlappingDistNodes.size()),
1887 &overlappingDistNodes[0], &overlappingIdxNodes[0]));
1897 template<
typename TreeType>
1900 using Ptr = std::unique_ptr<VoxelizationData>;
1904 using UCharTreeType =
typename TreeType::template ValueConverter<unsigned char>::Type;
1915 , indexAcc(indexTree)
1916 , primIdTree(MaxPrimId)
1917 , primIdAcc(primIdTree)
1947 if (mPrimCount == MaxPrimId || primIdTree.leafCount() > 1000) {
1949 primIdTree.root().clear();
1950 primIdTree.clearAllAccessors();
1951 assert(mPrimCount == 0);
1954 return mPrimCount++;
1959 enum { MaxPrimId = 100 };
1961 unsigned char mPrimCount;
1965 template<
typename TreeType,
typename MeshDataAdapter,
typename Interrupter = util::NullInterrupter>
1971 using DataTable = tbb::enumerable_thread_specific<typename VoxelizationDataType::Ptr>;
1975 Interrupter* interrupter =
nullptr)
1976 : mDataTable(&dataTable)
1978 , mInterrupter(interrupter)
1989 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
1992 tbb::task::self().cancel_group_execution();
1996 const size_t numVerts = mMesh->vertexCount(n);
1999 if (numVerts == 3 || numVerts == 4) {
2001 prim.index =
Int32(n);
2003 mMesh->getIndexSpacePoint(n, 0, prim.a);
2004 mMesh->getIndexSpacePoint(n, 1, prim.b);
2005 mMesh->getIndexSpacePoint(n, 2, prim.c);
2007 evalTriangle(prim, *dataPtr);
2009 if (numVerts == 4) {
2010 mMesh->getIndexSpacePoint(n, 3, prim.b);
2011 evalTriangle(prim, *dataPtr);
2019 bool wasInterrupted()
const {
return mInterrupter && mInterrupter->wasInterrupted(); }
2021 struct Triangle {
Vec3d a, b, c;
Int32 index; };
2025 enum { POLYGON_LIMIT = 1000 };
2027 SubTask(
const Triangle& prim, DataTable& dataTable,
2028 int subdivisionCount,
size_t polygonCount,
2029 Interrupter* interrupter =
nullptr)
2030 : mLocalDataTable(&dataTable)
2032 , mSubdivisionCount(subdivisionCount)
2033 , mPolygonCount(polygonCount)
2034 , mInterrupter(interrupter)
2038 void operator()()
const
2040 if (mSubdivisionCount <= 0 || mPolygonCount >= POLYGON_LIMIT) {
2042 typename VoxelizationDataType::Ptr& dataPtr = mLocalDataTable->local();
2043 if (!dataPtr) dataPtr.reset(
new VoxelizationDataType());
2045 voxelizeTriangle(mPrim, *dataPtr, mInterrupter);
2047 }
else if (!(mInterrupter && mInterrupter->wasInterrupted())) {
2048 spawnTasks(mPrim, *mLocalDataTable, mSubdivisionCount, mPolygonCount, mInterrupter);
2052 DataTable *
const mLocalDataTable;
2053 Triangle
const mPrim;
2054 int const mSubdivisionCount;
2055 size_t const mPolygonCount;
2056 Interrupter *
const mInterrupter;
2059 inline static int evalSubdivisionCount(
const Triangle& prim)
2061 const double ax = prim.a[0], bx = prim.b[0], cx = prim.c[0];
2064 const double ay = prim.a[1], by = prim.b[1], cy = prim.c[1];
2067 const double az = prim.a[2], bz = prim.b[2], cz = prim.c[2];
2070 return int(
std::max(dx,
std::max(dy, dz)) /
double(TreeType::LeafNodeType::DIM * 2));
2073 void evalTriangle(
const Triangle& prim, VoxelizationDataType& data)
const
2075 const size_t polygonCount = mMesh->polygonCount();
2076 const int subdivisionCount =
2077 polygonCount < SubTask::POLYGON_LIMIT ? evalSubdivisionCount(prim) : 0;
2079 if (subdivisionCount <= 0) {
2080 voxelizeTriangle(prim, data, mInterrupter);
2082 spawnTasks(prim, *mDataTable, subdivisionCount, polygonCount, mInterrupter);
2086 static void spawnTasks(
2087 const Triangle& mainPrim,
2088 DataTable& dataTable,
2089 int subdivisionCount,
2090 size_t polygonCount,
2091 Interrupter*
const interrupter)
2093 subdivisionCount -= 1;
2096 tbb::task_group tasks;
2098 const Vec3d ac = (mainPrim.a + mainPrim.c) * 0.5;
2099 const Vec3d bc = (mainPrim.b + mainPrim.c) * 0.5;
2100 const Vec3d ab = (mainPrim.a + mainPrim.b) * 0.5;
2103 prim.index = mainPrim.index;
2105 prim.a = mainPrim.a;
2108 tasks.run(SubTask(prim, dataTable, subdivisionCount, polygonCount, interrupter));
2113 tasks.run(SubTask(prim, dataTable, subdivisionCount, polygonCount, interrupter));
2116 prim.b = mainPrim.b;
2118 tasks.run(SubTask(prim, dataTable, subdivisionCount, polygonCount, interrupter));
2122 prim.c = mainPrim.c;
2123 tasks.run(SubTask(prim, dataTable, subdivisionCount, polygonCount, interrupter));
2128 static void voxelizeTriangle(
const Triangle& prim, VoxelizationDataType& data, Interrupter*
const interrupter)
2130 std::deque<Coord> coordList;
2133 ijk = Coord::floor(prim.a);
2134 coordList.push_back(ijk);
2139 updateDistance(ijk, prim, data);
2141 unsigned char primId = data.getNewPrimId();
2142 data.primIdAcc.setValueOnly(ijk, primId);
2144 while (!coordList.empty()) {
2145 if (interrupter && interrupter->wasInterrupted()) {
2146 tbb::task::self().cancel_group_execution();
2149 for (
Int32 pass = 0; pass < 1048576 && !coordList.empty(); ++pass) {
2150 ijk = coordList.back();
2151 coordList.pop_back();
2153 for (
Int32 i = 0; i < 26; ++i) {
2155 if (primId != data.primIdAcc.getValue(nijk)) {
2156 data.primIdAcc.setValueOnly(nijk, primId);
2157 if(updateDistance(nijk, prim, data)) coordList.push_back(nijk);
2164 static bool updateDistance(
const Coord& ijk,
const Triangle& prim, VoxelizationDataType& data)
2166 Vec3d uvw, voxelCenter(ijk[0], ijk[1], ijk[2]);
2168 using ValueType =
typename TreeType::ValueType;
2170 const ValueType dist = ValueType((voxelCenter -
2175 if (std::isnan(dist))
2178 const ValueType oldDist = data.distAcc.getValue(ijk);
2180 if (dist < oldDist) {
2181 data.distAcc.setValue(ijk, dist);
2182 data.indexAcc.setValue(ijk, prim.index);
2186 data.indexAcc.setValueOnly(ijk,
std::min(prim.index, data.indexAcc.getValue(ijk)));
2189 return !(dist > 0.75);
2192 DataTable *
const mDataTable;
2194 Interrupter *
const mInterrupter;
2201 template<
typename TreeType>
2207 using BoolTreeType =
typename TreeType::template ValueConverter<bool>::Type;
2211 std::vector<BoolLeafNodeType*>& lhsNodes)
2212 : mRhsTree(&rhsTree), mLhsNodes(lhsNodes.empty() ? nullptr : &lhsNodes[0])
2220 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
2225 if (rhsNode) lhsNode->topologyDifference(*rhsNode,
false);
2230 TreeType
const *
const mRhsTree;
2231 BoolLeafNodeType **
const mLhsNodes;
2235 template<
typename LeafNodeTypeA,
typename LeafNodeTypeB>
2239 : mNodesA(nodesA.empty() ? nullptr : &nodesA[0])
2240 , mNodesB(nodesB.empty() ? nullptr : &nodesB[0])
2245 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
2246 mNodesA[n]->topologyUnion(*mNodesB[n]);
2251 LeafNodeTypeA **
const mNodesA;
2252 LeafNodeTypeB **
const mNodesB;
2256 template<
typename TreeType>
2261 using BoolTreeType =
typename TreeType::template ValueConverter<bool>::Type;
2265 std::vector<LeafNodeType*>& nodes)
2267 , mNodes(nodes.empty() ? nullptr : &nodes[0])
2268 , mLocalMaskTree(false)
2269 , mMaskTree(&maskTree)
2275 , mNodes(rhs.mNodes)
2276 , mLocalMaskTree(false)
2277 , mMaskTree(&mLocalMaskTree)
2283 using Iterator =
typename LeafNodeType::ValueOnCIter;
2288 Coord ijk, nijk, localCorod;
2291 for (
size_t n = range.begin(); n != range.end(); ++n) {
2295 CoordBBox bbox = node.getNodeBoundingBox();
2300 for (Iterator it = node.cbeginValueOn(); it; ++it) {
2301 ijk = it.getCoord();
2304 localCorod = LeafNodeType::offsetToLocalCoord(pos);
2306 if (localCorod[2] <
int(LeafNodeType::DIM - 1)) {
2308 if (!node.isValueOn(npos)) maskNode.setValueOn(npos);
2314 if (localCorod[2] > 0) {
2316 if (!node.isValueOn(npos)) maskNode.setValueOn(npos);
2322 if (localCorod[1] <
int(LeafNodeType::DIM - 1)) {
2323 npos = pos + LeafNodeType::DIM;
2324 if (!node.isValueOn(npos)) maskNode.setValueOn(npos);
2330 if (localCorod[1] > 0) {
2331 npos = pos - LeafNodeType::DIM;
2332 if (!node.isValueOn(npos)) maskNode.setValueOn(npos);
2338 if (localCorod[0] <
int(LeafNodeType::DIM - 1)) {
2339 npos = pos + LeafNodeType::DIM * LeafNodeType::DIM;
2340 if (!node.isValueOn(npos)) maskNode.setValueOn(npos);
2346 if (localCorod[0] > 0) {
2347 npos = pos - LeafNodeType::DIM * LeafNodeType::DIM;
2348 if (!node.isValueOn(npos)) maskNode.setValueOn(npos);
2360 TreeType
const *
const mTree;
2361 LeafNodeType **
const mNodes;
2363 BoolTreeType mLocalMaskTree;
2364 BoolTreeType *
const mMaskTree;
2369 template<
typename TreeType,
typename MeshDataAdapter>
2377 using BoolTreeType =
typename TreeType::template ValueConverter<bool>::Type;
2388 : idx(idx_), x(x_), y(y_), z(z_), dist(dist_)
2398 std::vector<BoolLeafNodeType*>& maskNodes,
2406 : mMaskNodes(maskNodes.empty() ? nullptr : &maskNodes[0])
2407 , mMaskTree(&maskTree)
2408 , mDistTree(&distTree)
2409 , mIndexTree(&indexTree)
2411 , mNewMaskTree(false)
2413 , mUpdatedDistNodes()
2415 , mUpdatedIndexNodes()
2416 , mExteriorBandWidth(exteriorBandWidth)
2417 , mInteriorBandWidth(interiorBandWidth)
2418 , mVoxelSize(voxelSize)
2423 : mMaskNodes(rhs.mMaskNodes)
2424 , mMaskTree(rhs.mMaskTree)
2425 , mDistTree(rhs.mDistTree)
2426 , mIndexTree(rhs.mIndexTree)
2428 , mNewMaskTree(false)
2430 , mUpdatedDistNodes()
2432 , mUpdatedIndexNodes()
2433 , mExteriorBandWidth(rhs.mExteriorBandWidth)
2434 , mInteriorBandWidth(rhs.mInteriorBandWidth)
2435 , mVoxelSize(rhs.mVoxelSize)
2441 mDistNodes.insert(mDistNodes.end(), rhs.mDistNodes.begin(), rhs.mDistNodes.end());
2442 mIndexNodes.insert(mIndexNodes.end(), rhs.mIndexNodes.begin(), rhs.mIndexNodes.end());
2444 mUpdatedDistNodes.insert(mUpdatedDistNodes.end(),
2445 rhs.mUpdatedDistNodes.begin(), rhs.mUpdatedDistNodes.end());
2447 mUpdatedIndexNodes.insert(mUpdatedIndexNodes.end(),
2448 rhs.mUpdatedIndexNodes.begin(), rhs.mUpdatedIndexNodes.end());
2450 mNewMaskTree.merge(rhs.mNewMaskTree);
2459 std::vector<Fragment> fragments;
2460 fragments.reserve(256);
2462 std::unique_ptr<LeafNodeType> newDistNodePt;
2463 std::unique_ptr<Int32LeafNodeType> newIndexNodePt;
2465 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
2468 if (maskNode.isEmpty())
continue;
2472 const Coord& origin = maskNode.origin();
2477 assert(!distNodePt == !indexNodePt);
2479 bool usingNewNodes =
false;
2481 if (!distNodePt && !indexNodePt) {
2485 if (!newDistNodePt.get() && !newIndexNodePt.get()) {
2486 newDistNodePt.reset(
new LeafNodeType(origin, backgroundDist));
2490 if ((backgroundDist <
ValueType(0.0)) !=
2491 (newDistNodePt->getValue(0) <
ValueType(0.0))) {
2492 newDistNodePt->buffer().fill(backgroundDist);
2495 newDistNodePt->setOrigin(origin);
2496 newIndexNodePt->setOrigin(origin);
2499 distNodePt = newDistNodePt.get();
2500 indexNodePt = newIndexNodePt.get();
2502 usingNewNodes =
true;
2509 for (
typename BoolLeafNodeType::ValueOnIter it = maskNode.beginValueOn(); it; ++it) {
2510 bbox.
expand(it.getCoord());
2515 gatherFragments(fragments, bbox, distAcc, indexAcc);
2520 bbox = maskNode.getNodeBoundingBox();
2522 bool updatedLeafNodes =
false;
2524 for (
typename BoolLeafNodeType::ValueOnIter it = maskNode.beginValueOn(); it; ++it) {
2526 const Coord ijk = it.getCoord();
2528 if (updateVoxel(ijk, 5, fragments, *distNodePt, *indexNodePt, &updatedLeafNodes)) {
2530 for (
Int32 i = 0; i < 6; ++i) {
2533 mask.setOn(BoolLeafNodeType::coordToOffset(nijk));
2539 for (
Int32 i = 6; i < 26; ++i) {
2542 mask.setOn(BoolLeafNodeType::coordToOffset(nijk));
2548 if (updatedLeafNodes) {
2551 mask -= indexNodePt->getValueMask();
2553 for (
typename NodeMaskType::OnIterator it = mask.beginOn(); it; ++it) {
2555 const Index pos = it.pos();
2556 const Coord ijk = maskNode.origin() + LeafNodeType::offsetToLocalCoord(pos);
2558 if (updateVoxel(ijk, 6, fragments, *distNodePt, *indexNodePt)) {
2559 for (
Int32 i = 0; i < 6; ++i) {
2566 if (usingNewNodes) {
2567 newDistNodePt->topologyUnion(*newIndexNodePt);
2568 mDistNodes.push_back(newDistNodePt.release());
2569 mIndexNodes.push_back(newIndexNodePt.release());
2571 mUpdatedDistNodes.push_back(distNodePt);
2572 mUpdatedIndexNodes.push_back(indexNodePt);
2592 gatherFragments(std::vector<Fragment>& fragments,
const CoordBBox& bbox,
2596 const Coord nodeMin = bbox.
min() & ~(LeafNodeType::DIM - 1);
2597 const Coord nodeMax = bbox.
max() & ~(LeafNodeType::DIM - 1);
2602 for (ijk[0] = nodeMin[0]; ijk[0] <= nodeMax[0]; ijk[0] += LeafNodeType::DIM) {
2603 for (ijk[1] = nodeMin[1]; ijk[1] <= nodeMax[1]; ijk[1] += LeafNodeType::DIM) {
2604 for (ijk[2] = nodeMin[2]; ijk[2] <= nodeMax[2]; ijk[2] += LeafNodeType::DIM) {
2605 if (LeafNodeType* distleaf = distAcc.
probeLeaf(ijk)) {
2608 ijk.
offsetBy(LeafNodeType::DIM - 1));
2609 gatherFragments(fragments, region, *distleaf, *indexAcc.
probeLeaf(ijk));
2615 std::sort(fragments.begin(), fragments.end());
2619 gatherFragments(std::vector<Fragment>& fragments,
const CoordBBox& bbox,
2620 const LeafNodeType& distLeaf,
const Int32LeafNodeType& idxLeaf)
const
2622 const typename LeafNodeType::NodeMaskType& mask = distLeaf.getValueMask();
2623 const ValueType* distData = distLeaf.buffer().data();
2624 const Int32* idxData = idxLeaf.buffer().data();
2626 for (
int x = bbox.min()[0]; x <= bbox.max()[0]; ++x) {
2627 const Index xPos = (x & (LeafNodeType::DIM - 1u)) << (2 * LeafNodeType::LOG2DIM);
2628 for (
int y = bbox.min()[1]; y <= bbox.max()[1]; ++y) {
2629 const Index yPos = xPos + ((y & (LeafNodeType::DIM - 1u)) << LeafNodeType::LOG2DIM);
2630 for (
int z = bbox.min()[2]; z <= bbox.max()[2]; ++z) {
2631 const Index pos = yPos + (z & (LeafNodeType::DIM - 1u));
2632 if (mask.isOn(pos)) {
2633 fragments.push_back(Fragment(idxData[pos],x,y,z, std::abs(distData[pos])));
2643 computeDistance(
const Coord& ijk,
const Int32 manhattanLimit,
2644 const std::vector<Fragment>& fragments,
Int32& closestPrimIdx)
const
2646 Vec3d a, b, c, uvw, voxelCenter(ijk[0], ijk[1], ijk[2]);
2650 for (
size_t n = 0, N = fragments.size(); n < N; ++n) {
2652 const Fragment& fragment = fragments[n];
2653 if (lastIdx == fragment.idx)
continue;
2655 const Int32 dx = std::abs(fragment.x - ijk[0]);
2656 const Int32 dy = std::abs(fragment.y - ijk[1]);
2657 const Int32 dz = std::abs(fragment.z - ijk[2]);
2659 const Int32 manhattan = dx + dy + dz;
2660 if (manhattan > manhattanLimit)
continue;
2662 lastIdx = fragment.idx;
2664 const size_t polygon = size_t(lastIdx);
2666 mMesh->getIndexSpacePoint(polygon, 0, a);
2667 mMesh->getIndexSpacePoint(polygon, 1, b);
2668 mMesh->getIndexSpacePoint(polygon, 2, c);
2670 primDist = (voxelCenter -
2674 if (4 == mMesh->vertexCount(polygon)) {
2676 mMesh->getIndexSpacePoint(polygon, 3, b);
2679 a, b, c, voxelCenter, uvw)).lengthSqr();
2681 if (tmpDist < primDist) primDist = tmpDist;
2684 if (primDist < dist) {
2686 closestPrimIdx = lastIdx;
2690 return ValueType(std::sqrt(dist)) * mVoxelSize;
2696 updateVoxel(
const Coord& ijk,
const Int32 manhattanLimit,
2697 const std::vector<Fragment>& fragments,
2698 LeafNodeType& distLeaf, Int32LeafNodeType& idxLeaf,
bool* updatedLeafNodes =
nullptr)
2700 Int32 closestPrimIdx = 0;
2701 const ValueType distance = computeDistance(ijk, manhattanLimit, fragments, closestPrimIdx);
2703 const Index pos = LeafNodeType::coordToOffset(ijk);
2704 const bool inside = distLeaf.getValue(pos) < ValueType(0.0);
2706 bool activateNeighbourVoxels =
false;
2708 if (!inside && distance < mExteriorBandWidth) {
2709 if (updatedLeafNodes) *updatedLeafNodes =
true;
2710 activateNeighbourVoxels = (distance + mVoxelSize) < mExteriorBandWidth;
2711 distLeaf.setValueOnly(pos, distance);
2712 idxLeaf.setValueOn(pos, closestPrimIdx);
2713 }
else if (inside && distance < mInteriorBandWidth) {
2714 if (updatedLeafNodes) *updatedLeafNodes =
true;
2715 activateNeighbourVoxels = (distance + mVoxelSize) < mInteriorBandWidth;
2716 distLeaf.setValueOnly(pos, -distance);
2717 idxLeaf.setValueOn(pos, closestPrimIdx);
2720 return activateNeighbourVoxels;
2725 BoolLeafNodeType **
const mMaskNodes;
2726 BoolTreeType *
const mMaskTree;
2727 TreeType *
const mDistTree;
2728 Int32TreeType *
const mIndexTree;
2732 BoolTreeType mNewMaskTree;
2734 std::vector<LeafNodeType*> mDistNodes, mUpdatedDistNodes;
2735 std::vector<Int32LeafNodeType*> mIndexNodes, mUpdatedIndexNodes;
2737 const ValueType mExteriorBandWidth, mInteriorBandWidth, mVoxelSize;
2741 template<
typename TreeType>
2745 AddNodes(TreeType& tree, std::vector<LeafNodeType*>& nodes)
2746 : mTree(&tree) , mNodes(&nodes)
2752 std::vector<LeafNodeType*>& nodes = *mNodes;
2753 for (
size_t n = 0, N = nodes.size(); n < N; ++n) {
2763 template<
typename TreeType,
typename Int32TreeType,
typename BoolTreeType,
typename MeshDataAdapter>
2767 Int32TreeType& indexTree,
2768 BoolTreeType& maskTree,
2769 std::vector<typename BoolTreeType::LeafNodeType*>& maskNodes,
2771 typename TreeType::ValueType exteriorBandWidth,
2772 typename TreeType::ValueType interiorBandWidth,
2773 typename TreeType::ValueType voxelSize)
2776 distTree, indexTree, mesh, exteriorBandWidth, interiorBandWidth, voxelSize);
2778 tbb::parallel_reduce(tbb::blocked_range<size_t>(0, maskNodes.size()), expandOp);
2780 tbb::parallel_for(tbb::blocked_range<size_t>(0, expandOp.
updatedIndexNodes().size()),
2784 tbb::task_group tasks;
2798 template<
typename TreeType>
2807 , mVoxelSize(voxelSize)
2808 , mUnsigned(unsignedDist)
2814 typename LeafNodeType::ValueOnIter iter;
2816 const bool udf = mUnsigned;
2817 const ValueType w[2] = { -mVoxelSize, mVoxelSize };
2819 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
2821 for (iter = mNodes[n]->beginValueOn(); iter; ++iter) {
2823 val = w[udf || (val <
ValueType(0.0))] * std::sqrt(std::abs(val));
2829 LeafNodeType * *
const mNodes;
2830 const ValueType mVoxelSize;
2831 const bool mUnsigned;
2836 template<
typename TreeType>
2844 : mNodes(nodes.empty() ? nullptr : &nodes[0])
2845 , mExBandWidth(exBandWidth)
2846 , mInBandWidth(inBandWidth)
2852 typename LeafNodeType::ValueOnIter iter;
2856 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
2858 for (iter = mNodes[n]->beginValueOn(); iter; ++iter) {
2862 const bool inside = val <
ValueType(0.0);
2864 if (inside && !(val > inVal)) {
2867 }
else if (!inside && !(val < exVal)) {
2876 LeafNodeType * *
const mNodes;
2877 const ValueType mExBandWidth, mInBandWidth;
2881 template<
typename TreeType>
2888 : mNodes(nodes.empty() ? nullptr : &nodes[0]), mOffset(offset)
2896 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
2898 typename LeafNodeType::ValueOnIter iter = mNodes[n]->beginValueOn();
2900 for (; iter; ++iter) {
2908 LeafNodeType * *
const mNodes;
2909 const ValueType mOffset;
2913 template<
typename TreeType>
2919 Renormalize(
const TreeType& tree,
const std::vector<LeafNodeType*>& nodes,
2922 , mNodes(nodes.empty() ? nullptr : &nodes[0])
2924 , mVoxelSize(voxelSize)
2939 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
2941 ValueType* bufferData = &mBuffer[n * LeafNodeType::SIZE];
2943 typename LeafNodeType::ValueOnCIter iter = mNodes[n]->cbeginValueOn();
2944 for (; iter; ++iter) {
2948 ijk = iter.getCoord();
2963 bufferData[iter.pos()] = phi0 - dx * S * diff;
2969 TreeType
const *
const mTree;
2970 LeafNodeType
const *
const *
const mNodes;
2971 ValueType *
const mBuffer;
2973 const ValueType mVoxelSize;
2977 template<
typename TreeType>
2984 : mNodes(nodes.empty() ? nullptr : &nodes[0]), mBuffer(buffer)
2990 for (
size_t n = range.begin(), N = range.end(); n < N; ++n) {
2992 const ValueType* bufferData = &mBuffer[n * LeafNodeType::SIZE];
2994 typename LeafNodeType::ValueOnIter iter = mNodes[n]->beginValueOn();
2996 for (; iter; ++iter) {
2998 val =
std::min(val, bufferData[iter.pos()]);
3004 LeafNodeType * *
const mNodes;
3005 ValueType
const *
const mBuffer;
3017 template <
typename FloatTreeT>
3026 ConnectivityTable nodeConnectivity(tree);
3028 std::vector<size_t> zStartNodes, yStartNodes, xStartNodes;
3033 for (
size_t n = 0; n < nodeConnectivity.size(); ++n) {
3034 if (ConnectivityTable::INVALID_OFFSET == nodeConnectivity.offsetsPrevX()[n]) {
3035 xStartNodes.push_back(n);
3038 if (ConnectivityTable::INVALID_OFFSET == nodeConnectivity.offsetsPrevY()[n]) {
3039 yStartNodes.push_back(n);
3042 if (ConnectivityTable::INVALID_OFFSET == nodeConnectivity.offsetsPrevZ()[n]) {
3043 zStartNodes.push_back(n);
3052 tbb::parallel_for(tbb::blocked_range<size_t>(0, zStartNodes.size()),
3055 tbb::parallel_for(tbb::blocked_range<size_t>(0, yStartNodes.size()),
3058 tbb::parallel_for(tbb::blocked_range<size_t>(0, xStartNodes.size()),
3061 const size_t numLeafNodes = nodeConnectivity.size();
3062 const size_t numVoxels = numLeafNodes * FloatTreeT::LeafNodeType::SIZE;
3064 std::unique_ptr<bool[]> changedNodeMaskA{
new bool[numLeafNodes]};
3065 std::unique_ptr<bool[]> changedNodeMaskB{
new bool[numLeafNodes]};
3066 std::unique_ptr<bool[]> changedVoxelMask{
new bool[numVoxels]};
3072 const tbb::blocked_range<size_t> nodeRange(0, numLeafNodes);
3074 bool nodesUpdated =
false;
3080 nodeConnectivity.nodes(), changedNodeMaskA.get()));
3089 nodeConnectivity, changedNodeMaskA.get(), changedNodeMaskB.get(),
3090 changedVoxelMask.get()));
3094 changedNodeMaskA.swap(changedNodeMaskB);
3096 nodesUpdated =
false;
3097 for (
size_t n = 0; n < numLeafNodes; ++n) {
3098 nodesUpdated |= changedNodeMaskA[n];
3099 if (nodesUpdated)
break;
3106 nodeConnectivity.nodes(), changedNodeMaskA.get(), changedVoxelMask.get()));
3108 }
while (nodesUpdated);
3116 template <
typename Gr
idType,
typename MeshDataAdapter,
typename Interrupter>
3117 inline typename GridType::Ptr
3119 Interrupter& interrupter,
3122 float exteriorBandWidth,
3123 float interiorBandWidth,
3127 using GridTypePtr =
typename GridType::Ptr;
3128 using TreeType =
typename GridType::TreeType;
3129 using LeafNodeType =
typename TreeType::LeafNodeType;
3130 using ValueType =
typename GridType::ValueType;
3133 using Int32TreeType =
typename Int32GridType::TreeType;
3135 using BoolTreeType =
typename TreeType::template ValueConverter<bool>::Type;
3142 distGrid->setTransform(transform.
copy());
3144 ValueType exteriorWidth = ValueType(exteriorBandWidth);
3145 ValueType interiorWidth = ValueType(interiorBandWidth);
3149 if (!std::isfinite(exteriorWidth) || std::isnan(interiorWidth)) {
3150 std::stringstream msg;
3151 msg <<
"Illegal narrow band width: exterior = " << exteriorWidth
3152 <<
", interior = " << interiorWidth;
3157 const ValueType voxelSize = ValueType(transform.
voxelSize()[0]);
3159 if (!std::isfinite(voxelSize) ||
math::isZero(voxelSize)) {
3160 std::stringstream msg;
3161 msg <<
"Illegal transform, voxel size = " << voxelSize;
3167 exteriorWidth *= voxelSize;
3171 interiorWidth *= voxelSize;
3179 Int32GridType* indexGrid =
nullptr;
3181 typename Int32GridType::Ptr temporaryIndexGrid;
3183 if (polygonIndexGrid) {
3184 indexGrid = polygonIndexGrid;
3187 indexGrid = temporaryIndexGrid.get();
3190 indexGrid->newTree();
3191 indexGrid->setTransform(transform.
copy());
3193 if (computeSignedDistanceField) {
3197 interiorWidth = ValueType(0.0);
3200 TreeType& distTree = distGrid->tree();
3201 Int32TreeType& indexTree = indexGrid->tree();
3210 using DataTable = tbb::enumerable_thread_specific<typename VoxelizationDataType::Ptr>;
3216 const tbb::blocked_range<size_t> polygonRange(0, mesh.polygonCount());
3218 tbb::parallel_for(polygonRange, Voxelizer(data, mesh, &interrupter));
3220 for (
typename DataTable::iterator i = data.begin(); i != data.end(); ++i) {
3221 VoxelizationDataType& dataItem = **i;
3223 distTree, indexTree, dataItem.distTree, dataItem.indexTree);
3229 if (interrupter.wasInterrupted(30))
return distGrid;
3236 if (computeSignedDistanceField) {
3241 std::vector<LeafNodeType*> nodes;
3242 nodes.reserve(distTree.leafCount());
3243 distTree.getNodes(nodes);
3245 const tbb::blocked_range<size_t> nodeRange(0, nodes.size());
3250 tbb::parallel_for(nodeRange, SignOp(nodes, distTree, indexTree, mesh));
3252 if (interrupter.wasInterrupted(45))
return distGrid;
3255 if (removeIntersectingVoxels) {
3257 tbb::parallel_for(nodeRange,
3260 tbb::parallel_for(nodeRange,
3262 nodes, distTree, indexTree));
3269 if (interrupter.wasInterrupted(50))
return distGrid;
3271 if (distTree.activeVoxelCount() == 0) {
3273 distTree.root().setBackground(exteriorWidth,
false);
3279 std::vector<LeafNodeType*> nodes;
3280 nodes.reserve(distTree.leafCount());
3281 distTree.getNodes(nodes);
3283 tbb::parallel_for(tbb::blocked_range<size_t>(0, nodes.size()),
3285 nodes, voxelSize, !computeSignedDistanceField));
3289 if (computeSignedDistanceField) {
3290 distTree.root().setBackground(exteriorWidth,
false);
3296 if (interrupter.wasInterrupted(54))
return distGrid;
3303 const ValueType minBandWidth = voxelSize * ValueType(2.0);
3305 if (interiorWidth > minBandWidth || exteriorWidth > minBandWidth) {
3308 BoolTreeType maskTree(
false);
3311 std::vector<LeafNodeType*> nodes;
3312 nodes.reserve(distTree.leafCount());
3313 distTree.getNodes(nodes);
3316 tbb::parallel_reduce(tbb::blocked_range<size_t>(0, nodes.size()), op);
3322 float progress = 54.0f, step = 0.0f;
3324 2.0 * std::ceil((
std::max(interiorWidth, exteriorWidth) - minBandWidth) / voxelSize);
3326 if (estimated <
double(maxIterations)) {
3327 maxIterations = unsigned(estimated);
3328 step = 40.0f / float(maxIterations);
3331 std::vector<typename BoolTreeType::LeafNodeType*> maskNodes;
3336 if (interrupter.wasInterrupted(
int(progress)))
return distGrid;
3338 const size_t maskNodeCount = maskTree.leafCount();
3339 if (maskNodeCount == 0)
break;
3342 maskNodes.reserve(maskNodeCount);
3343 maskTree.getNodes(maskNodes);
3345 const tbb::blocked_range<size_t> range(0, maskNodes.size());
3347 tbb::parallel_for(range,
3351 mesh, exteriorWidth, interiorWidth, voxelSize);
3353 if ((++count) >= maxIterations)
break;
3358 if (interrupter.wasInterrupted(94))
return distGrid;
3360 if (!polygonIndexGrid) indexGrid->clear();
3368 if (computeSignedDistanceField && renormalizeValues) {
3370 std::vector<LeafNodeType*> nodes;
3371 nodes.reserve(distTree.leafCount());
3372 distTree.getNodes(nodes);
3374 std::unique_ptr<ValueType[]> buffer{
new ValueType[LeafNodeType::SIZE * nodes.size()]};
3376 const ValueType offset = ValueType(0.8 * voxelSize);
3378 tbb::parallel_for(tbb::blocked_range<size_t>(0, nodes.size()),
3381 tbb::parallel_for(tbb::blocked_range<size_t>(0, nodes.size()),
3383 distTree, nodes, buffer.get(), voxelSize));
3385 tbb::parallel_for(tbb::blocked_range<size_t>(0, nodes.size()),
3388 tbb::parallel_for(tbb::blocked_range<size_t>(0, nodes.size()),
3393 if (interrupter.wasInterrupted(99))
return distGrid;
3400 if (trimNarrowBand &&
std::min(interiorWidth, exteriorWidth) < voxelSize * ValueType(4.0)) {
3402 std::vector<LeafNodeType*> nodes;
3403 nodes.reserve(distTree.leafCount());
3404 distTree.getNodes(nodes);
3406 tbb::parallel_for(tbb::blocked_range<size_t>(0, nodes.size()),
3408 nodes, exteriorWidth, computeSignedDistanceField ? interiorWidth : exteriorWidth));
3411 distTree, exteriorWidth, computeSignedDistanceField ? -interiorWidth : -exteriorWidth);
3418 template <
typename Gr
idType,
typename MeshDataAdapter>
3419 inline typename GridType::Ptr
3423 float exteriorBandWidth,
3424 float interiorBandWidth,
3429 return meshToVolume<GridType>(nullInterrupter, mesh, transform,
3430 exteriorBandWidth, interiorBandWidth, flags, polygonIndexGrid);
3441 template<
typename Gr
idType,
typename Interrupter>
3442 inline typename std::enable_if<std::is_floating_point<typename GridType::ValueType>::value,
3443 typename GridType::Ptr>::type
3445 Interrupter& interrupter,
3446 const openvdb::math::Transform& xform,
3447 const std::vector<Vec3s>& points,
3448 const std::vector<Vec3I>& triangles,
3449 const std::vector<Vec4I>& quads,
3452 bool unsignedDistanceField =
false)
3454 if (points.empty()) {
3455 return typename GridType::Ptr(
new GridType(
typename GridType::ValueType(exBandWidth)));
3458 const size_t numPoints = points.size();
3459 std::unique_ptr<Vec3s[]> indexSpacePoints{
new Vec3s[numPoints]};
3462 tbb::parallel_for(tbb::blocked_range<size_t>(0, numPoints),
3463 mesh_to_volume_internal::TransformPoints<Vec3s>(
3464 &points[0], indexSpacePoints.get(), xform));
3468 if (quads.empty()) {
3470 QuadAndTriangleDataAdapter<Vec3s, Vec3I>
3471 mesh(indexSpacePoints.get(), numPoints, &triangles[0], triangles.size());
3473 return meshToVolume<GridType>(
3474 interrupter, mesh, xform, exBandWidth, inBandWidth, conversionFlags);
3476 }
else if (triangles.empty()) {
3478 QuadAndTriangleDataAdapter<Vec3s, Vec4I>
3479 mesh(indexSpacePoints.get(), numPoints, &quads[0], quads.size());
3481 return meshToVolume<GridType>(
3482 interrupter, mesh, xform, exBandWidth, inBandWidth, conversionFlags);
3487 const size_t numPrimitives = triangles.size() + quads.size();
3488 std::unique_ptr<Vec4I[]> prims{
new Vec4I[numPrimitives]};
3490 for (
size_t n = 0, N = triangles.size(); n < N; ++n) {
3491 const Vec3I& triangle = triangles[n];
3492 Vec4I& prim = prims[n];
3493 prim[0] = triangle[0];
3494 prim[1] = triangle[1];
3495 prim[2] = triangle[2];
3499 const size_t offset = triangles.size();
3500 for (
size_t n = 0, N = quads.size(); n < N; ++n) {
3501 prims[offset + n] = quads[n];
3504 QuadAndTriangleDataAdapter<Vec3s, Vec4I>
3505 mesh(indexSpacePoints.get(), numPoints, prims.get(), numPrimitives);
3507 return meshToVolume<GridType>(interrupter, mesh, xform,
3508 exBandWidth, inBandWidth, conversionFlags);
3514 template<
typename Gr
idType,
typename Interrupter>
3515 inline typename std::enable_if<!std::is_floating_point<typename GridType::ValueType>::value,
3516 typename GridType::Ptr>::type
3519 const math::Transform& ,
3520 const std::vector<Vec3s>& ,
3521 const std::vector<Vec3I>& ,
3522 const std::vector<Vec4I>& ,
3528 "mesh to volume conversion is supported only for scalar floating-point grids");
3538 template<
typename Gr
idType>
3539 inline typename GridType::Ptr
3541 const openvdb::math::Transform& xform,
3542 const std::vector<Vec3s>& points,
3543 const std::vector<Vec3I>& triangles,
3547 std::vector<Vec4I> quads(0);
3548 return doMeshConversion<GridType>(nullInterrupter, xform, points, triangles, quads,
3549 halfWidth, halfWidth);
3553 template<
typename Gr
idType,
typename Interrupter>
3554 inline typename GridType::Ptr
3556 Interrupter& interrupter,
3557 const openvdb::math::Transform& xform,
3558 const std::vector<Vec3s>& points,
3559 const std::vector<Vec3I>& triangles,
3562 std::vector<Vec4I> quads(0);
3563 return doMeshConversion<GridType>(interrupter, xform, points, triangles, quads,
3564 halfWidth, halfWidth);
3568 template<
typename Gr
idType>
3569 inline typename GridType::Ptr
3571 const openvdb::math::Transform& xform,
3572 const std::vector<Vec3s>& points,
3573 const std::vector<Vec4I>& quads,
3577 std::vector<Vec3I> triangles(0);
3578 return doMeshConversion<GridType>(nullInterrupter, xform, points, triangles, quads,
3579 halfWidth, halfWidth);
3583 template<
typename Gr
idType,
typename Interrupter>
3584 inline typename GridType::Ptr
3586 Interrupter& interrupter,
3587 const openvdb::math::Transform& xform,
3588 const std::vector<Vec3s>& points,
3589 const std::vector<Vec4I>& quads,
3592 std::vector<Vec3I> triangles(0);
3593 return doMeshConversion<GridType>(interrupter, xform, points, triangles, quads,
3594 halfWidth, halfWidth);
3598 template<
typename Gr
idType>
3599 inline typename GridType::Ptr
3601 const openvdb::math::Transform& xform,
3602 const std::vector<Vec3s>& points,
3603 const std::vector<Vec3I>& triangles,
3604 const std::vector<Vec4I>& quads,
3608 return doMeshConversion<GridType>(nullInterrupter, xform, points, triangles, quads,
3609 halfWidth, halfWidth);
3613 template<
typename Gr
idType,
typename Interrupter>
3614 inline typename GridType::Ptr
3616 Interrupter& interrupter,
3617 const openvdb::math::Transform& xform,
3618 const std::vector<Vec3s>& points,
3619 const std::vector<Vec3I>& triangles,
3620 const std::vector<Vec4I>& quads,
3623 return doMeshConversion<GridType>(interrupter, xform, points, triangles, quads,
3624 halfWidth, halfWidth);
3628 template<
typename Gr
idType>
3629 inline typename GridType::Ptr
3631 const openvdb::math::Transform& xform,
3632 const std::vector<Vec3s>& points,
3633 const std::vector<Vec3I>& triangles,
3634 const std::vector<Vec4I>& quads,
3639 return doMeshConversion<GridType>(nullInterrupter, xform, points, triangles,
3640 quads, exBandWidth, inBandWidth);
3644 template<
typename Gr
idType,
typename Interrupter>
3645 inline typename GridType::Ptr
3647 Interrupter& interrupter,
3648 const openvdb::math::Transform& xform,
3649 const std::vector<Vec3s>& points,
3650 const std::vector<Vec3I>& triangles,
3651 const std::vector<Vec4I>& quads,
3655 return doMeshConversion<GridType>(interrupter, xform, points, triangles,
3656 quads, exBandWidth, inBandWidth);
3660 template<
typename Gr
idType>
3661 inline typename GridType::Ptr
3663 const openvdb::math::Transform& xform,
3664 const std::vector<Vec3s>& points,
3665 const std::vector<Vec3I>& triangles,
3666 const std::vector<Vec4I>& quads,
3670 return doMeshConversion<GridType>(nullInterrupter, xform, points, triangles, quads,
3671 bandWidth, bandWidth,
true);
3675 template<
typename Gr
idType,
typename Interrupter>
3676 inline typename GridType::Ptr
3678 Interrupter& interrupter,
3679 const openvdb::math::Transform& xform,
3680 const std::vector<Vec3s>& points,
3681 const std::vector<Vec3I>& triangles,
3682 const std::vector<Vec4I>& quads,
3685 return doMeshConversion<GridType>(interrupter, xform, points, triangles, quads,
3686 bandWidth, bandWidth,
true);
3694 inline std::ostream&
3697 ostr <<
"{[ " << rhs.
mXPrim <<
", " << rhs.
mXDist <<
"]";
3698 ostr <<
" [ " << rhs.
mYPrim <<
", " << rhs.
mYDist <<
"]";
3699 ostr <<
" [ " << rhs.
mZPrim <<
", " << rhs.
mZDist <<
"]}";
3704 inline MeshToVoxelEdgeData::EdgeData
3719 const std::vector<Vec3s>& pointList,
3720 const std::vector<Vec4I>& polygonList);
3722 void run(
bool threaded =
true);
3725 inline void operator() (
const tbb::blocked_range<size_t> &range);
3733 struct Primitive {
Vec3d a, b, c, d;
Int32 index; };
3735 template<
bool IsQuad>
3736 inline void voxelize(
const Primitive&);
3738 template<
bool IsQuad>
3739 inline bool evalPrimitive(
const Coord&,
const Primitive&);
3741 inline bool rayTriangleIntersection(
const Vec3d& origin,
const Vec3d& dir,
3748 const std::vector<Vec3s>& mPointList;
3749 const std::vector<Vec4I>& mPolygonList;
3752 using IntTreeT = TreeType::ValueConverter<Int32>::Type;
3753 IntTreeT mLastPrimTree;
3759 MeshToVoxelEdgeData::GenEdgeData::GenEdgeData(
3760 const std::vector<Vec3s>& pointList,
3761 const std::vector<Vec4I>& polygonList)
3764 , mPointList(pointList)
3765 , mPolygonList(polygonList)
3767 , mLastPrimAccessor(mLastPrimTree)
3776 , mPointList(rhs.mPointList)
3777 , mPolygonList(rhs.mPolygonList)
3779 , mLastPrimAccessor(mLastPrimTree)
3788 tbb::parallel_reduce(tbb::blocked_range<size_t>(0, mPolygonList.size()), *
this);
3790 (*this)(tbb::blocked_range<size_t>(0, mPolygonList.size()));
3799 using NodeChainType = RootNodeType::NodeChainType;
3800 static_assert(NodeChainType::Size > 1,
"expected tree height > 1");
3801 using InternalNodeType =
typename NodeChainType::template Get<1>;
3809 for ( ; leafIt; ++leafIt) {
3810 ijk = leafIt->origin();
3816 mAccessor.addLeaf(rhs.mAccessor.
probeLeaf(ijk));
3817 InternalNodeType* node = rhs.mAccessor.
getNode<InternalNodeType>();
3819 rhs.mAccessor.
clear();
3829 if (!lhsLeafPt->isValueOn(offset)) {
3830 lhsLeafPt->setValueOn(offset, rhsValue);
3862 for (
size_t n = range.begin(); n < range.end(); ++n) {
3864 const Vec4I& verts = mPolygonList[n];
3866 prim.index =
Int32(n);
3867 prim.a =
Vec3d(mPointList[verts[0]]);
3868 prim.b =
Vec3d(mPointList[verts[1]]);
3869 prim.c =
Vec3d(mPointList[verts[2]]);
3872 prim.d =
Vec3d(mPointList[verts[3]]);
3873 voxelize<true>(prim);
3875 voxelize<false>(prim);
3881 template<
bool IsQuad>
3883 MeshToVoxelEdgeData::GenEdgeData::voxelize(
const Primitive& prim)
3885 std::deque<Coord> coordList;
3889 coordList.push_back(ijk);
3891 evalPrimitive<IsQuad>(ijk, prim);
3893 while (!coordList.empty()) {
3895 ijk = coordList.back();
3896 coordList.pop_back();
3898 for (
Int32 i = 0; i < 26; ++i) {
3901 if (prim.index != mLastPrimAccessor.getValue(nijk)) {
3902 mLastPrimAccessor.setValue(nijk, prim.index);
3903 if(evalPrimitive<IsQuad>(nijk, prim)) coordList.push_back(nijk);
3910 template<
bool IsQuad>
3912 MeshToVoxelEdgeData::GenEdgeData::evalPrimitive(
const Coord& ijk,
const Primitive& prim)
3914 Vec3d uvw, org(ijk[0], ijk[1], ijk[2]);
3915 bool intersecting =
false;
3919 mAccessor.probeValue(ijk, edgeData);
3922 double dist = (org -
3925 if (rayTriangleIntersection(org,
Vec3d(1.0, 0.0, 0.0), prim.a, prim.c, prim.b, t)) {
3926 if (t < edgeData.mXDist) {
3927 edgeData.mXDist = float(t);
3928 edgeData.mXPrim = prim.index;
3929 intersecting =
true;
3933 if (rayTriangleIntersection(org,
Vec3d(0.0, 1.0, 0.0), prim.a, prim.c, prim.b, t)) {
3934 if (t < edgeData.mYDist) {
3935 edgeData.mYDist = float(t);
3936 edgeData.mYPrim = prim.index;
3937 intersecting =
true;
3941 if (rayTriangleIntersection(org,
Vec3d(0.0, 0.0, 1.0), prim.a, prim.c, prim.b, t)) {
3942 if (t < edgeData.mZDist) {
3943 edgeData.mZDist = float(t);
3944 edgeData.mZPrim = prim.index;
3945 intersecting =
true;
3951 double secondDist = (org -
3954 if (secondDist < dist) dist = secondDist;
3956 if (rayTriangleIntersection(org,
Vec3d(1.0, 0.0, 0.0), prim.a, prim.d, prim.c, t)) {
3957 if (t < edgeData.mXDist) {
3958 edgeData.mXDist = float(t);
3959 edgeData.mXPrim = prim.index;
3960 intersecting =
true;
3964 if (rayTriangleIntersection(org,
Vec3d(0.0, 1.0, 0.0), prim.a, prim.d, prim.c, t)) {
3965 if (t < edgeData.mYDist) {
3966 edgeData.mYDist = float(t);
3967 edgeData.mYPrim = prim.index;
3968 intersecting =
true;
3972 if (rayTriangleIntersection(org,
Vec3d(0.0, 0.0, 1.0), prim.a, prim.d, prim.c, t)) {
3973 if (t < edgeData.mZDist) {
3974 edgeData.mZDist = float(t);
3975 edgeData.mZPrim = prim.index;
3976 intersecting =
true;
3981 if (intersecting) mAccessor.setValue(ijk, edgeData);
3983 return (dist < 0.86602540378443861);
3988 MeshToVoxelEdgeData::GenEdgeData::rayTriangleIntersection(
3999 double divisor = s1.
dot(e1);
4000 if (!(std::abs(divisor) > 0.0))
return false;
4004 double inv_divisor = 1.0 / divisor;
4005 Vec3d d = origin - a;
4006 double b1 = d.
dot(s1) * inv_divisor;
4008 if (b1 < 0.0 || b1 > 1.0)
return false;
4011 double b2 = dir.
dot(s2) * inv_divisor;
4013 if (b2 < 0.0 || (b1 + b2) > 1.0)
return false;
4017 t = e2.dot(s2) * inv_divisor;
4018 return (t < 0.0) ? false :
true;
4034 const std::vector<Vec3s>& pointList,
4035 const std::vector<Vec4I>& polygonList)
4049 std::vector<Vec3d>& points,
4050 std::vector<Index32>& primitives)
4060 point[0] = double(coord[0]) + data.
mXDist;
4061 point[1] = double(coord[1]);
4062 point[2] = double(coord[2]);
4064 points.push_back(point);
4065 primitives.push_back(data.
mXPrim);
4069 point[0] = double(coord[0]);
4070 point[1] = double(coord[1]) + data.
mYDist;
4071 point[2] = double(coord[2]);
4073 points.push_back(point);
4074 primitives.push_back(data.
mYPrim);
4078 point[0] = double(coord[0]);
4079 point[1] = double(coord[1]);
4080 point[2] = double(coord[2]) + data.
mZDist;
4082 points.push_back(point);
4083 primitives.push_back(data.
mZPrim);
4093 point[0] = double(coord[0]);
4094 point[1] = double(coord[1]) + data.
mYDist;
4095 point[2] = double(coord[2]);
4097 points.push_back(point);
4098 primitives.push_back(data.
mYPrim);
4102 point[0] = double(coord[0]);
4103 point[1] = double(coord[1]);
4104 point[2] = double(coord[2]) + data.
mZDist;
4106 points.push_back(point);
4107 primitives.push_back(data.
mZPrim);
4115 point[0] = double(coord[0]);
4116 point[1] = double(coord[1]) + data.
mYDist;
4117 point[2] = double(coord[2]);
4119 points.push_back(point);
4120 primitives.push_back(data.
mYPrim);
4129 point[0] = double(coord[0]) + data.
mXDist;
4130 point[1] = double(coord[1]);
4131 point[2] = double(coord[2]);
4133 points.push_back(point);
4134 primitives.push_back(data.
mXPrim);
4138 point[0] = double(coord[0]);
4139 point[1] = double(coord[1]) + data.
mYDist;
4140 point[2] = double(coord[2]);
4142 points.push_back(point);
4143 primitives.push_back(data.
mYPrim);
4153 point[0] = double(coord[0]) + data.
mXDist;
4154 point[1] = double(coord[1]);
4155 point[2] = double(coord[2]);
4157 points.push_back(point);
4158 primitives.push_back(data.
mXPrim);
4167 point[0] = double(coord[0]) + data.
mXDist;
4168 point[1] = double(coord[1]);
4169 point[2] = double(coord[2]);
4171 points.push_back(point);
4172 primitives.push_back(data.
mXPrim);
4176 point[0] = double(coord[0]);
4177 point[1] = double(coord[1]);
4178 point[2] = double(coord[2]) + data.
mZDist;
4180 points.push_back(point);
4181 primitives.push_back(data.
mZPrim);
4190 point[0] = double(coord[0]);
4191 point[1] = double(coord[1]);
4192 point[2] = double(coord[2]) + data.
mZDist;
4194 points.push_back(point);
4195 primitives.push_back(data.
mZPrim);
4201 template<
typename Gr
idType,
typename VecType>
4202 inline typename GridType::Ptr
4204 const openvdb::math::Transform& xform,
4205 typename VecType::ValueType halfWidth)
4211 points[0] =
Vec3s(pmin[0], pmin[1], pmin[2]);
4212 points[1] =
Vec3s(pmin[0], pmin[1], pmax[2]);
4213 points[2] =
Vec3s(pmax[0], pmin[1], pmax[2]);
4214 points[3] =
Vec3s(pmax[0], pmin[1], pmin[2]);
4215 points[4] =
Vec3s(pmin[0], pmax[1], pmin[2]);
4216 points[5] =
Vec3s(pmin[0], pmax[1], pmax[2]);
4217 points[6] =
Vec3s(pmax[0], pmax[1], pmax[2]);
4218 points[7] =
Vec3s(pmax[0], pmax[1], pmin[2]);
4221 faces[0] =
Vec4I(0, 1, 2, 3);
4222 faces[1] =
Vec4I(7, 6, 5, 4);
4223 faces[2] =
Vec4I(4, 5, 1, 0);
4224 faces[3] =
Vec4I(6, 7, 3, 2);
4225 faces[4] =
Vec4I(0, 3, 7, 4);
4226 faces[5] =
Vec4I(1, 5, 6, 2);
4230 return meshToVolume<GridType>(mesh, xform, halfWidth, halfWidth);
4238 #endif // OPENVDB_TOOLS_MESH_TO_VOLUME_HAS_BEEN_INCLUDED