guilhem_lavaux/vide_public
0
0
Fork 0
mirror of https://bitbucket.org/cosmicvoids/vide_public.git synced 2025-07-05 07:41:11 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Added support for 3d meshes. More walking algorithm

Browse source
This commit is contained in:
Guilhem Lavaux 2011-06-28 07:08:01 -05:00
parent bd339c3292
commit 69ba427705
1 changed files with 36 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

36
mytools/voidTree.hpp
View file

@ -163,6 +163,7 @@ public:
} }
computeMaxDepth(); computeMaxDepth();
computeChildrenByNode();
} }
VoidTree(ZobovRep& rep) VoidTree(ZobovRep& rep)
@ -222,6 +223,7 @@ public:
activeNodes = inserted+1; activeNodes = inserted+1;
computeMaxDepth(); computeMaxDepth();
computeChildrenByNode();
} }
~VoidTree() ~VoidTree()
@ -248,6 +250,40 @@ public:
std::cout << "maximum depth is " << _depth_computer(rootNode) << std::endl; std::cout << "maximum depth is " << _depth_computer(rootNode) << std::endl;
} }
struct _children_stat {
int num, min_num, max_num, num_zero,num_one, num_multiple;
};
void _children_computer(VoidNode *node, _children_stat& s)
{
VoidList::iterator i = node->children.begin();
int d = 0, j = 0;
while (i != node->children.end())
{
_children_computer(*i, s);
++i;
++j;
}
s.num += j;
if (j!= 0)
s.min_num = std::min(s.min_num, j);
else s.num_zero ++;
if (j==1) s.num_one++;
if (j>1) s.num_multiple++;
s.max_num = std::max(s.max_num, j);
}
void computeChildrenByNode()
{
_children_stat s;
s.num = 0;
s.min_num = activeNodes+1;
s.max_num = s.num_zero = s.num_one =s.num_multiple= 0;
_children_computer(rootNode, s);
std::cout << "Average children by node " << s.num*1.0/activeNodes << " , " << s.min_num << " " << s.max_num << " " << s.num_zero << " " << s.num_one << " " << s.num_multiple << std::endl;
}
int getParent(int vid) const int getParent(int vid) const
{ {
assert(nodes[vid].parent != 0); assert(nodes[vid].parent != 0);