lucaspalomodevelop/meshlab
1
0
Fork 0
mirror of https://github.com/lucaspalomodevelop/meshlab.git synced 2026-03-20 03:16:10 +00:00
Code Issues Packages Projects Releases Wiki Activity

the whole mesh is now visited

Browse Source
This commit is contained in:
Paolo Cignoni cignoni 2007-06-06 16:53:23 +00:00
parent 5f478d960c
commit 6b98a018ed
1 changed files with 22 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
src/meshlabplugins/editsegment/cutting.h
View File

@ -158,10 +158,13 @@ namespace vcg {
void MeshCut() {
VertexIterator vi;
int counter = 0;
for (vi=(*mesh).vert.begin(); vi!=(*mesh).vert.end(); ++vi) {
if ( !vi->IsD() && (*TDMarkPtr)[*vi].Mark != iF && (*TDMarkPtr)[*vi].Mark != iB)
if ( !vi->IsD() && (*TDMarkPtr)[*vi].Mark != iF && (*TDMarkPtr)[*vi].Mark != iB) {
(*TDMarkPtr)[*vi].Mark = U;
++counter;
}
}
//Computing principal curvatures and directions for all vertices
@ -169,19 +172,25 @@ namespace vcg {
ct.ComputeCurvatureTensor();
//now each vertex has principals curvatures and directions in its temp data
//second iteration on the marked vertex
for (vi=(*mesh).vert.begin(); vi!=(*mesh).vert.end(); ++vi) {
if ( !vi->IsD() && ((*TDMarkPtr)[*vi].Mark == iF || (*TDMarkPtr)[*vi].Mark == iB) )
AddNearestToQ(&(*vi));
}
//algorithm main loop
CuttingTriplet<VertexType> tempTriplet;
while(!Q.empty()) {
tempTriplet = Q.top();
Q.pop();
(*TDMarkPtr)[tempTriplet.v].Mark = tempTriplet.m;
AddNearestToQ(tempTriplet.v);
while (counter != 0) {
//second iteration on the marked vertex
for (vi=(*mesh).vert.begin(); vi!=(*mesh).vert.end(); ++vi) {
if ( !vi->IsD() && ((*TDMarkPtr)[*vi].Mark != U))
AddNearestToQ(&(*vi));
}
//algorithm main loop
CuttingTriplet<VertexType> tempTriplet;
while(!Q.empty()) {
tempTriplet = Q.top();
Q.pop();
if ( (*TDMarkPtr)[tempTriplet.v].Mark == U) {
(*TDMarkPtr)[tempTriplet.v].Mark = tempTriplet.m;
AddNearestToQ(tempTriplet.v);
--counter;
}
}
}
//checks if all vertices are marked