Cleaned up the UpdateFlags class. Assert into throw...
This commit is contained in:
parent
aca80c215b
commit
9cea19e537
|
@ -19,72 +19,6 @@
|
|||
* GNU General Public License (http://www.gnu.org/licenses/gpl.txt) *
|
||||
* for more details. *
|
||||
* *
|
||||
****************************************************************************/
|
||||
/****************************************************************************
|
||||
History
|
||||
|
||||
$Log: not supported by cvs2svn $
|
||||
Revision 1.20 2007/05/31 15:24:50 ponchio
|
||||
FIxed off-by-one error on FaceBorderFromNone.
|
||||
|
||||
Revision 1.19 2007/05/22 15:19:42 cignoni
|
||||
Added VertexClear
|
||||
|
||||
Revision 1.18 2007/01/30 18:49:23 tarini
|
||||
aggiunta la VertexBorderFromNone (flag bordo per vertici senza richiedere nulla)
|
||||
|
||||
Revision 1.17 2006/08/31 13:11:12 marfr960
|
||||
corrected bounds of a vector scan
|
||||
|
||||
Revision 1.16 2006/08/30 12:59:49 marfr960
|
||||
Added missing std:: to swap
|
||||
|
||||
Revision 1.15 2006/08/30 06:50:07 cignoni
|
||||
Reverted to version 1.13. Version 1.14 was done on outdated version.
|
||||
|
||||
Revision 1.13 2006/06/18 20:49:30 cignoni
|
||||
Added missing IsD tests
|
||||
|
||||
Revision 1.12 2006/05/03 21:23:25 cignoni
|
||||
Corrected IsDeleted -> isD
|
||||
|
||||
Revision 1.11 2005/12/02 00:09:12 cignoni
|
||||
Added assert(HasFlags) everywhere..
|
||||
|
||||
Revision 1.10 2005/07/06 08:16:34 ganovelli
|
||||
set VertexBorderFromFace as static
|
||||
|
||||
Revision 1.9 2005/06/10 15:07:23 cignoni
|
||||
Completed FaceBorderFromNone (and added a missing helper class)
|
||||
|
||||
Revision 1.8 2005/04/01 13:04:55 fiorin
|
||||
Minor changes
|
||||
|
||||
Revision 1.7 2004/09/14 19:49:43 ganovelli
|
||||
first compilation version
|
||||
|
||||
Revision 1.6 2004/07/15 00:13:39 cignoni
|
||||
Better doxigen documentation
|
||||
|
||||
Revision 1.5 2004/07/06 06:27:02 cignoni
|
||||
Added FaceBorderFromVF
|
||||
|
||||
Revision 1.4 2004/05/13 15:58:55 ganovelli
|
||||
function Clear added
|
||||
|
||||
Revision 1.3 2004/03/12 15:22:19 cignoni
|
||||
Written some documentation and added to the trimes doxygen module
|
||||
|
||||
Revision 1.2 2004/03/10 00:46:10 cignoni
|
||||
changed to the face::IsBorder() style
|
||||
|
||||
Revision 1.1 2004/03/05 10:59:24 cignoni
|
||||
Changed name from plural to singular (normals->normal)
|
||||
|
||||
Revision 1.1 2004/03/04 00:37:56 cignoni
|
||||
First working version!
|
||||
|
||||
|
||||
****************************************************************************/
|
||||
#ifndef __VCG_TRI_UPDATE_FLAGS
|
||||
#define __VCG_TRI_UPDATE_FLAGS
|
||||
|
@ -121,52 +55,56 @@ typedef typename MeshType::FaceType FaceType;
|
|||
typedef typename MeshType::FacePointer FacePointer;
|
||||
typedef typename MeshType::FaceIterator FaceIterator;
|
||||
|
||||
/// \brief Reset all the mesh flags (both vertexes and faces) setting everithing to zero (the default value for flags)
|
||||
/// \brief Reset all the mesh flags (vertexes edge faces) setting everithing to zero (the default value for flags)
|
||||
|
||||
static void Clear(MeshType &m)
|
||||
{
|
||||
assert(HasPerFaceFlags(m));
|
||||
FaceIterator fi;
|
||||
VertexIterator vi;
|
||||
for(fi=m.face.begin(); fi!=m.face.end(); ++fi)
|
||||
(*fi).Flags() = 0;
|
||||
for(vi=m.vert.begin(); vi!=m.vert.end(); ++vi)
|
||||
if(HasPerVertexFlags(m) )
|
||||
for(VertexIterator vi=m.vert.begin(); vi!=m.vert.end(); ++vi)
|
||||
(*vi).Flags() = 0;
|
||||
if(HasPerEdgeFlags(m) )
|
||||
for(EdgeIterator ei=m.edge.begin(); ei!=m.edge.end(); ++ei)
|
||||
(*ei).Flags() = 0;
|
||||
if(HasPerFaceFlags(m) )
|
||||
for(FaceIterator fi=m.face.begin(); fi!=m.face.end(); ++fi)
|
||||
(*fi).Flags() = 0;
|
||||
}
|
||||
|
||||
static void VertexClear(MeshType &m, unsigned int FlagMask = 0xffffffff)
|
||||
{
|
||||
VertexIterator vi;
|
||||
if(!HasPerVertexFlags(m)) throw vcg::MissingComponentException("VertexFlags");
|
||||
int andMask = ~FlagMask;
|
||||
for(vi=m.vert.begin(); vi!=m.vert.end(); ++vi)
|
||||
for(VertexIterator vi=m.vert.begin(); vi!=m.vert.end(); ++vi)
|
||||
if(!(*vi).IsD()) (*vi).Flags() &= andMask ;
|
||||
}
|
||||
|
||||
static void EdgeClear(MeshType &m, unsigned int FlagMask = 0xffffffff)
|
||||
{
|
||||
EdgeIterator ei;
|
||||
if(!HasPerEdgeFlags(m)) throw vcg::MissingComponentException("EdgeFlags");
|
||||
int andMask = ~FlagMask;
|
||||
for(ei=m.edge.begin(); ei!=m.edge.end(); ++ei)
|
||||
for(EdgeIterator ei=m.edge.begin(); ei!=m.edge.end(); ++ei)
|
||||
if(!(*ei).IsD()) (*ei).Flags() &= andMask ;
|
||||
}
|
||||
|
||||
static void FaceClear(MeshType &m, unsigned int FlagMask = 0xffffffff)
|
||||
{
|
||||
FaceIterator fi;
|
||||
if(!HasPerFaceFlags(m)) throw vcg::MissingComponentException("FaceFlags");
|
||||
int andMask = ~FlagMask;
|
||||
for(fi=m.face.begin(); fi!=m.face.end(); ++fi)
|
||||
for(FaceIterator fi=m.face.begin(); fi!=m.face.end(); ++fi)
|
||||
if(!(*fi).IsD()) (*fi).Flags() &= andMask ;
|
||||
}
|
||||
|
||||
static void VertexSet(MeshType &m, unsigned int FlagMask)
|
||||
{
|
||||
VertexIterator vi;
|
||||
for(vi=m.vert.begin(); vi!=m.vert.end(); ++vi)
|
||||
if(!HasPerVertexFlags(m)) throw vcg::MissingComponentException("VertexFlags");
|
||||
for(VertexIterator vi=m.vert.begin(); vi!=m.vert.end(); ++vi)
|
||||
if(!(*vi).IsD()) (*vi).Flags() |= FlagMask ;
|
||||
}
|
||||
|
||||
static void FaceSet(MeshType &m, unsigned int FlagMask)
|
||||
{
|
||||
FaceIterator fi;
|
||||
for(fi=m.face.begin(); fi!=m.face.end(); ++fi)
|
||||
if(!HasPerFaceFlags(m)) throw vcg::MissingComponentException("FaceFlags");
|
||||
for(FaceIterator fi=m.face.begin(); fi!=m.face.end(); ++fi)
|
||||
if(!(*fi).IsD()) (*fi).Flags() |= FlagMask ;
|
||||
}
|
||||
|
||||
|
@ -194,14 +132,11 @@ static void FaceSetF(MeshType &m) { FaceSet(m,FaceType::FAUX012);}
|
|||
*/
|
||||
static void FaceBorderFromFF(MeshType &m)
|
||||
{
|
||||
assert(HasPerFaceFlags(m));
|
||||
// const int BORDERFLAG[3]={FaceType::BORDER0,FaceType::BORDER1,FaceType::BORDER2};
|
||||
FaceIterator fi;
|
||||
for(fi=m.face.begin();fi!=m.face.end();++fi)if(!(*fi).IsD())
|
||||
if(!HasPerFaceFlags(m)) throw vcg::MissingComponentException("FaceFlags");
|
||||
if(!HasFFAdjacency(m)) throw vcg::MissingComponentException("FFAdj");
|
||||
for(FaceIterator fi=m.face.begin();fi!=m.face.end();++fi)if(!(*fi).IsD())
|
||||
for(int j=0;j<3;++j)
|
||||
{
|
||||
//if(!(*fi).IsManifold(j)) (*fi).SetCF(j);
|
||||
//else
|
||||
if(face::IsBorder(*fi,j)) (*fi).SetB(j);
|
||||
else (*fi).ClearB(j);
|
||||
}
|
||||
|
@ -210,9 +145,8 @@ static void FaceBorderFromFF(MeshType &m)
|
|||
|
||||
static void FaceBorderFromVF(MeshType &m)
|
||||
{
|
||||
assert(HasPerFaceFlags(m));
|
||||
assert(HasPerVertexVFAdjacency(m));
|
||||
assert(HasPerFaceVFAdjacency(m));
|
||||
if(!HasPerFaceFlags(m)) throw vcg::MissingComponentException("FaceFlags");
|
||||
if(!HasVFAdjacency(m)) throw vcg::MissingComponentException("VFAdj");
|
||||
|
||||
FaceClearB(m);
|
||||
int visitedBit=VertexType::NewBitFlag();
|
||||
|
@ -297,7 +231,8 @@ inline bool operator != ( const EdgeSorter & pe ) const
|
|||
// versione minimale che non calcola i complex flag.
|
||||
static void VertexBorderFromNone(MeshType &m)
|
||||
{
|
||||
assert(HasPerVertexFlags(m));
|
||||
if(!HasPerVertexFlags(m)) throw vcg::MissingComponentException("VertexFlags");
|
||||
|
||||
std::vector<EdgeSorter> e;
|
||||
typename UpdateMeshType::FaceIterator pf;
|
||||
typename std::vector<EdgeSorter>::iterator p;
|
||||
|
@ -342,7 +277,8 @@ static void VertexBorderFromNone(MeshType &m)
|
|||
/// It has a O(fn log fn) complexity.
|
||||
static void FaceBorderFromNone(MeshType &m)
|
||||
{
|
||||
assert(HasPerFaceFlags(m));
|
||||
if(!HasPerFaceFlags(m)) throw vcg::MissingComponentException("FaceFlags");
|
||||
|
||||
std::vector<EdgeSorter> e;
|
||||
typename UpdateMeshType::FaceIterator pf;
|
||||
typename std::vector<EdgeSorter>::iterator p;
|
||||
|
@ -391,48 +327,47 @@ static void FaceBorderFromNone(MeshType &m)
|
|||
// TRACE("found %i border (%i complex) on %i edges\n",nborder,ncomplex,ne);
|
||||
}
|
||||
|
||||
/// Compute the PerVertex Border flag deriving it from the faces
|
||||
/// Compute the PerVertex Border flag deriving it from the border flag of faces
|
||||
static void VertexBorderFromFace(MeshType &m)
|
||||
{
|
||||
assert(HasPerFaceFlags(m));
|
||||
typename MeshType::VertexIterator v;
|
||||
typename MeshType::FaceIterator f;
|
||||
if(!HasPerFaceFlags(m)) throw vcg::MissingComponentException("FaceFlags");
|
||||
if(!HasPerVertexFlags(m)) throw vcg::MissingComponentException("VertexFlags");
|
||||
|
||||
for(v=m.vert.begin();v!=m.vert.end();++v)
|
||||
(*v).ClearB();
|
||||
for(VertexIterator vi=m.vert.begin();vi!=m.vert.end();++vi)
|
||||
(*vi).ClearB();
|
||||
|
||||
for(f=m.face.begin();f!=m.face.end();++f)
|
||||
if(!(*f).IsD())
|
||||
for(FaceIterator fi=m.face.begin();fi!=m.face.end();++fi)
|
||||
if(!(*fi).IsD())
|
||||
{
|
||||
for(int z=0;z<(*f).VN();++z)
|
||||
if( (*f).IsB(z) )
|
||||
for(int z=0;z<(*fi).VN();++z)
|
||||
if( (*fi).IsB(z) )
|
||||
{
|
||||
(*f).V(z)->SetB();
|
||||
(*f).V((*f).Next(z))->SetB();
|
||||
(*fi).V(z)->SetB();
|
||||
(*fi).V((*fi).Next(z))->SetB();
|
||||
}
|
||||
}
|
||||
}
|
||||
//
|
||||
static void FaceFauxCrease(MeshType &m,float AngleRad)
|
||||
{
|
||||
assert(HasPerFaceFlags(m));
|
||||
assert(HasFFAdjacency(m));
|
||||
if(!HasPerFaceFlags(m)) throw vcg::MissingComponentException("FaceFlags");
|
||||
if(!HasFFAdjacency(m)) throw vcg::MissingComponentException("FFAdj");
|
||||
|
||||
typename MeshType::FaceIterator f;
|
||||
|
||||
//initially everything is faux (e.g all internal)
|
||||
FaceSetF(m);
|
||||
for(f=m.face.begin();f!=m.face.end();++f)
|
||||
for(FaceIterator fi=m.face.begin();fi!=m.face.end();++fi)
|
||||
{
|
||||
if(!(*f).IsD())
|
||||
if(!(*fi).IsD())
|
||||
{
|
||||
for(int z=0;z<(*f).VN();++z)
|
||||
for(int z=0;z<(*fi).VN();++z)
|
||||
{
|
||||
if( face::IsBorder(*f,z) ) (*f).ClearF(z);
|
||||
if( face::IsBorder(*fi,z) ) (*fi).ClearF(z);
|
||||
else
|
||||
{
|
||||
if(Angle((*f).N(), (*f).FFp(z)->N()) > AngleRad)
|
||||
(*f).ClearF(z);
|
||||
if(Angle((*fi).N(), (*fi).FFp(z)->N()) > AngleRad)
|
||||
(*fi).ClearF(z);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
Loading…
Reference in New Issue