32 #include "WHierarchicalTreeVoxels.h"
58 std::pair<size_t, size_t>tmp2;
61 m_colors.push_back( WColor( 0.3, 0.3, 0.3, 1.0 ) );
72 size_t level = std::max(
m_level[cluster1],
m_level[cluster2] ) + 1;
79 m_colors.push_back( WColor( 0.3, 0.3, 0.3, 1.0 ) );
81 std::pair<size_t, size_t>childs( cluster1, cluster2 );
84 std::vector<size_t>leafes;
100 for(
size_t i = 0; i < returnVec.size(); ++i )
110 std::list<size_t>worklist;
111 std::vector<size_t>returnVector;
118 while( !worklist.empty() )
120 size_t current = worklist.front();
121 worklist.pop_front();
129 worklist.push_back( left );
133 returnVector.push_back( left );
137 worklist.push_back( right );
141 returnVector.push_back( right );
151 std::list<size_t>worklist;
152 std::vector<size_t>returnVector;
158 if( ( distanceCheckVector[
m_children[i].first] > 0 ) || ( distanceCheckVector[
m_children[i].second] > 0 ) )
160 distanceCheckVector[i] = 2;
164 distanceCheckVector[i] = 1;
165 returnVector.push_back( i );
173 std::vector<size_t>returnVector;
175 std::list<size_t>worklist;
176 worklist.push_back( root );
178 while( worklist.size() < number )
180 size_t current = worklist.front();
181 worklist.pop_front();
186 worklist.push_back( left );
187 worklist.push_back( right );
191 std::cout << number <<
" clusters at " <<
m_customData[worklist.front()] <<
" energy" << std::endl;
193 std::list<size_t>::iterator it;
194 for( it = worklist.begin(); it != worklist.end(); ++it )
196 size_t current = *it;
197 returnVector.push_back( current );