manolas
/
vcglib
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

removed unused var

This commit is contained in:
Paolo Cignoni 2015-09-24 16:41:58 +00:00
parent 874346d211
commit 48f65697f0
1 changed files with 10 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
vcg/space/index/kdtree/kdtree.h
View File

@ -157,7 +157,7 @@ namespace vcg {
// compute the AABB of the input // compute the AABB of the input
mPoints[0] = points[0]; mPoints[0] = points[0];
mAABB.Set(mPoints[0]); mAABB.Set(mPoints[0]);
for (unsigned int i=1 ; i<mPoints.size() ; ++i) for (unsigned int i=1 ; i<mPoints.size() ; ++i)
{ {
mPoints[i] = points[i]; mPoints[i] = points[i];
mIndices[i] = i; mIndices[i] = i;
@ -165,10 +165,11 @@ namespace vcg {
} }
mNodes.reserve(4*mPoints.size()/nofPointsPerCell); mNodes.reserve(4*mPoints.size()/nofPointsPerCell);
//first node inserted (no leaf). The others are made by the createTree function (recursively) //first node inserted (no leaf). The others are made by the createTree function (recursively)
mNodes.resize(1); mNodes.resize(1);
mNodes.back().leaf = 0; mNodes.back().leaf = 0;
int numLevel = createTree(0, 0, mPoints.size(), 1, nofPointsPerCell, maxDepth); /*int numLevel = */
createTree(0, 0, mPoints.size(), 1, nofPointsPerCell, maxDepth);
} }
template<typename Scalar> template<typename Scalar>
@ -469,7 +470,7 @@ namespace vcg {
node.firstChildId = mNodes.size(); node.firstChildId = mNodes.size();
mNodes.resize(mNodes.size()+2); mNodes.resize(mNodes.size()+2);
int leftLevel, rightLevel; int leftLevel, rightLevel;
{ {
// left child // left child
@ -480,7 +481,7 @@ namespace vcg {
child.leaf = 1; child.leaf = 1;
child.start = start; child.start = start;
child.size = midId - start; child.size = midId - start;
leftLevel = level; leftLevel = level;
} }
else else
{ {
@ -498,7 +499,7 @@ namespace vcg {
child.leaf = 1; child.leaf = 1;
child.start = midId; child.start = midId;
child.size = end - midId; child.size = end - midId;
rightLevel = level; rightLevel = level;
} }
else else
{ {
@ -506,9 +507,9 @@ namespace vcg {
rightLevel = createTree(childId, midId, end, level+1, targetCellSize, targetMaxDepth); rightLevel = createTree(childId, midId, end, level+1, targetCellSize, targetMaxDepth);
} }
} }
if (leftLevel > rightLevel) if (leftLevel > rightLevel)
return leftLevel; return leftLevel;
return rightLevel; return rightLevel;
} }
} }