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

harmless small refactoring

This commit is contained in:
Paolo Cignoni 2013-03-13 14:59:34 +00:00
parent f62e07ee66
commit 5aaa6f4720
1 changed files with 34 additions and 36 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
vcg/complex/algorithms/crease_cut.h
View File

@ -74,9 +74,7 @@ void CreaseCut(MESH_TYPE &m, float angleRad)
std::vector<int> indVec(m.fn*3,-1); std::vector<int> indVec(m.fn*3,-1);
int newVertexCounter=m.vn; int newVertexCounter=m.vn;
int startVn=m.vn; int startVn=m.vn;
FaceIterator fi; for(FaceIterator fi=m.face.begin();fi!=m.face.end();++fi)
//const FaceType * nextf;
for(fi=m.face.begin();fi!=m.face.end();++fi)
for(int j=0;j<3;++j) for(int j=0;j<3;++j)
if(!(*fi).V(j)->IsV() ) // foreach unvisited vertex we loop around it searching for creases. if(!(*fi).V(j)->IsV() ) // foreach unvisited vertex we loop around it searching for creases.
{ {
@ -121,7 +119,7 @@ void CreaseCut(MESH_TYPE &m, float angleRad)
tri::Allocator<MESH_TYPE>::AddVertices(m,newVertexCounter-m.vn); tri::Allocator<MESH_TYPE>::AddVertices(m,newVertexCounter-m.vn);
tri::UpdateFlags<MESH_TYPE>::VertexClearV(m); tri::UpdateFlags<MESH_TYPE>::VertexClearV(m);
for(fi=m.face.begin();fi!=m.face.end();++fi) for(FaceIterator fi=m.face.begin();fi!=m.face.end();++fi)
for(int j=0;j<3;++j) // foreach unvisited vertex for(int j=0;j<3;++j) // foreach unvisited vertex
{ {
size_t faceInd = Index(m, *fi); size_t faceInd = Index(m, *fi);