385 lines
12 KiB
C++
385 lines
12 KiB
C++
/****************************************************************************
|
|
* VCGLib o o *
|
|
* Visual and Computer Graphics Library o o *
|
|
* _ O _ *
|
|
* Copyright(C) 2004 \/)\/ *
|
|
* Visual Computing Lab /\/| *
|
|
* ISTI - Italian National Research Council | *
|
|
* \ *
|
|
* All rights reserved. *
|
|
* *
|
|
* This program is free software; you can redistribute it and/or modify *
|
|
* it under the terms of the GNU General Public License as published by *
|
|
* the Free Software Foundation; either version 2 of the License, or *
|
|
* (at your option) any later version. *
|
|
* *
|
|
* This program is distributed in the hope that it will be useful, *
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
|
|
* GNU General Public License (http://www.gnu.org/licenses/gpl.txt) *
|
|
* for more details. *
|
|
* *
|
|
****************************************************************************/
|
|
/****************************************************************************
|
|
History
|
|
|
|
$Log: not supported by cvs2svn $
|
|
Revision 1.26 2006/02/28 12:13:49 spinelli
|
|
fix bug end iterator++
|
|
|
|
Revision 1.25 2005/11/10 15:37:58 cignoni
|
|
Removed flags clearing (now it should be in the constructor of face and vertex)
|
|
|
|
Revision 1.24 2005/10/13 09:32:11 cignoni
|
|
Re-inserted the cFFp and cVFp access. If only the const version of the member function exists, the compiler will call it
|
|
when a non-const object invokes that function
|
|
|
|
Revision 1.23 2005/10/12 17:26:19 ponchio
|
|
cFFp doesn not exist -> FFp (there is the const version...)
|
|
same for cVFp.
|
|
|
|
Revision 1.22 2005/10/12 10:47:21 cignoni
|
|
Removed clearing of flags of added faces. Now the flag component has a constructor that clear it.
|
|
FF and VF adjacency are updated only if they are present and consistent (e.g. only if VFp(k) != 0 or FFp(k)!=0)
|
|
|
|
Revision 1.21 2005/07/01 11:22:00 cignoni
|
|
Corrected for the fourth time line a cast to Facetype at line 341.
|
|
Read the notes there before changing it again
|
|
|
|
Revision 1.20 2005/06/09 14:14:29 ganovelli
|
|
two warnings on type cast
|
|
|
|
Revision 1.19 2005/04/27 16:08:39 callieri
|
|
in addfaces, added casting for face* returned from vertex.VFp() [borland]
|
|
|
|
Revision 1.18 2005/03/23 13:22:57 turini
|
|
Wrong left parenthesis removed.
|
|
|
|
Revision 1.17 2005/03/23 11:29:49 ganovelli
|
|
cast int->iterator corrected
|
|
|
|
Revision 1.16 2005/02/19 10:43:11 ponchio
|
|
reverted tarini mod
|
|
|
|
Revision 1.15 2005/02/08 17:14:28 tarini
|
|
aggiunto un typecast a (FaceType*) per farlo compilare under Mingw comp
|
|
|
|
Revision 1.14 2004/10/14 15:08:04 pietroni
|
|
added #include <vector>
|
|
|
|
Revision 1.13 2004/09/07 07:36:32 fasano
|
|
Replaced some typename definitions
|
|
|
|
Revision 1.12 2004/08/25 15:15:26 ganovelli
|
|
minor changes to comply gcc compiler (typename's and stuff)
|
|
|
|
Revision 1.11 2004/08/07 17:38:00 pietroni
|
|
solved errors on AddFaces relative to VFp pointers of faces
|
|
|
|
Revision 1.10 2004/08/07 16:16:32 pietroni
|
|
corrected errors in AddFaces ( must be updated pointers to chain of faces of VFTopology)
|
|
|
|
Revision 1.9 2004/08/05 16:44:06 pietroni
|
|
added addafaces funtion with local values
|
|
|
|
Revision 1.8 2004/07/15 11:40:34 ganovelli
|
|
VFb to VFp
|
|
|
|
Revision 1.7 2004/05/11 14:12:13 ganovelli
|
|
general comment: minor modifications to compile with g++. Almost all
|
|
insertions of "typename" keyword and new line at the end of file
|
|
|
|
Revision 1.6 2004/05/10 13:24:21 cignoni
|
|
Updated names of adj functions and added ending newline
|
|
|
|
Revision 1.5 2004/04/21 14:06:10 ganovelli
|
|
#ifndef added
|
|
|
|
Revision 1.4 2004/03/31 14:43:56 cignoni
|
|
bug in update of VF adj
|
|
|
|
Revision 1.3 2004/03/12 15:25:29 cignoni
|
|
Corrected bug on the return of a wrong iterator
|
|
|
|
Revision 1.2 2004/03/03 15:35:52 cignoni
|
|
Yet another cr lf mismatch
|
|
|
|
Revision 1.1 2004/02/24 21:36:42 cignoni
|
|
grouped documentation, changed typenames and reflection mechanism
|
|
|
|
Revision 1.1 2004/02/19 13:11:06 cignoni
|
|
Initial commit
|
|
|
|
|
|
****************************************************************************/
|
|
|
|
#ifndef __VCGLIB_TRIALLOCATOR
|
|
#define __VCGLIB_TRIALLOCATOR
|
|
|
|
#include <vector>
|
|
|
|
namespace vcg {
|
|
namespace tri {
|
|
/** \addtogroup trimesh */
|
|
/*@{*/
|
|
/// Class to safely add vertexes and faces to a mesh updating all the involved pointers.
|
|
/// It provides static memeber to add either vertex or faces to a trimesh.
|
|
template <class AllocateMeshType>
|
|
class Allocator
|
|
{
|
|
|
|
public:
|
|
typedef AllocateMeshType MeshType;
|
|
typedef typename MeshType::VertexType VertexType;
|
|
typedef typename MeshType::VertexPointer VertexPointer;
|
|
typedef typename MeshType::VertexIterator VertexIterator;
|
|
typedef typename MeshType::FaceType FaceType;
|
|
typedef typename MeshType::FacePointer FacePointer;
|
|
typedef typename MeshType::FaceIterator FaceIterator;
|
|
|
|
/** This class is used when allocating new vertexes and faces to update
|
|
the pointers that can be changed when resizing the involved vectors of vertex or faces.
|
|
It can also be used to prevent any update of the various mesh fields
|
|
(e.g. in case you are building all the connections by hand as in a importer);
|
|
*/
|
|
template<class SimplexPointerType>
|
|
class PointerUpdater
|
|
{
|
|
public:
|
|
void Clear(){newBase=oldBase=newEnd=oldEnd=0;preventUpdateFlag=false;};
|
|
void Update(SimplexPointerType &vp)
|
|
{
|
|
vp=newBase+(vp-oldBase);
|
|
}
|
|
bool NeedUpdate() {if(newBase!=oldBase && !preventUpdateFlag) return true; else return false;}
|
|
|
|
SimplexPointerType oldBase;
|
|
SimplexPointerType newBase;
|
|
SimplexPointerType newEnd;
|
|
SimplexPointerType oldEnd;
|
|
bool preventUpdateFlag; /// when true no update is considered necessary.
|
|
};
|
|
|
|
|
|
/** Function to add n vertices to the mesh. The second parameter hold a vector of
|
|
pointers to pointer to elements of the mesh that should be updated after a
|
|
possible vector realloc.
|
|
@param n Il numero di vertici che si vuole aggiungere alla mesh.
|
|
@param local_var Vettore di variabili locali che rappresentano puntatori a vertici.
|
|
restituisce l'iteratore al primo elemento aggiunto.
|
|
*/
|
|
static VertexIterator AddVertices(MeshType &m,int n, PointerUpdater<VertexPointer> &pu)
|
|
{
|
|
VertexIterator last;
|
|
pu.Clear();
|
|
if(m.vert.empty()) pu.oldBase=0; // if the vector is empty we cannot find the last valid element
|
|
else pu.oldBase=&*m.vert.begin();
|
|
|
|
for(int i=0; i<n; ++i)
|
|
{
|
|
m.vert.push_back(VertexType());
|
|
// m.vert.back().ClearFlags(); // No more necessary, since 9/2005 flags are set to zero in the constuctor.
|
|
}
|
|
|
|
m.vn+=n;
|
|
|
|
pu.newBase = &*m.vert.begin();
|
|
if(pu.NeedUpdate())
|
|
{
|
|
FaceIterator fi;
|
|
for (fi=m.face.begin(); fi!=m.face.end(); ++fi)
|
|
if(!(*fi).IsD())
|
|
{
|
|
pu.Update((*fi).V(0));
|
|
pu.Update((*fi).V(1));
|
|
pu.Update((*fi).V(2));
|
|
}
|
|
|
|
// e poiche' lo spazio e' cambiato si ricalcola anche last da zero
|
|
|
|
}
|
|
unsigned int siz=(unsigned int)m.vert.size()-n;
|
|
|
|
last = m.vert.begin();
|
|
advance(last,siz);
|
|
|
|
return last;// deve restituire l'iteratore alla prima faccia aggiunta;
|
|
}
|
|
|
|
static VertexIterator AddVertices(MeshType &m, int n)
|
|
{
|
|
PointerUpdater<VertexPointer> pu;
|
|
return AddVertices(m, n,pu);
|
|
}
|
|
|
|
|
|
/** Function to add n faces to the mesh.
|
|
@param n Il numero di facce che si vuole aggiungere alla mesh
|
|
*/
|
|
static FaceIterator AddFaces(MeshType &m, int n,std::vector<FacePointer *> &local_var)
|
|
{
|
|
PointerUpdater<FacePointer> pu;
|
|
return AddFaces(m,n,pu,local_var);
|
|
}
|
|
/** Function to add n faces to the mesh.
|
|
NOTA: Aggiorna fn;
|
|
*/
|
|
static FaceIterator AddFaces(MeshType &m, int n, PointerUpdater<FacePointer> &pu,std::vector<FacePointer *> &local_var)
|
|
{
|
|
FaceIterator last = m.face.end();
|
|
pu.Clear();
|
|
if(m.face.empty()) {
|
|
pu.oldBase=0; // if the vector is empty we cannot find the last valid element
|
|
} else {
|
|
pu.oldBase=&*m.face.begin();
|
|
last=m.face.end();
|
|
}
|
|
for(int i=0; i<n; ++i)
|
|
{
|
|
m.face.push_back(FaceType());
|
|
m.face.back().ClearFlags();
|
|
}
|
|
|
|
m.fn+=n;
|
|
|
|
pu.newBase = &*m.face.begin();
|
|
|
|
if(pu.NeedUpdate())
|
|
{
|
|
/* std::vector<FacePointer *>::iterator it;
|
|
for (it=local_var.begin();it<local_var.end();it++)
|
|
{
|
|
pu.Update((FacePointer&)(*it));
|
|
}*/
|
|
|
|
typename std::vector<FaceType **>::iterator jit;
|
|
for(jit=local_var.begin(); jit!=local_var.end(); ++jit)
|
|
if((**jit) !=0 )
|
|
{
|
|
//FaceType **f =(**jit);
|
|
pu.Update(**jit);
|
|
}
|
|
|
|
FaceIterator fi;
|
|
for (fi=m.face.begin(); fi!=m.face.end(); ++fi)
|
|
if(!(*fi).IsD())
|
|
{
|
|
if(FaceType::HasFFAdjacency())
|
|
{
|
|
pu.Update((*fi).FFp(0));
|
|
pu.Update((*fi).FFp(1));
|
|
pu.Update((*fi).FFp(2));
|
|
}
|
|
if(FaceType::HasVFAdjacency())
|
|
{
|
|
if ((*fi).VFp(0)!=0)
|
|
pu.Update((*fi).VFp(0));
|
|
if ((*fi).VFp(1)!=0)
|
|
pu.Update((*fi).VFp(1));
|
|
if ((*fi).VFp(2)!=0)
|
|
pu.Update((*fi).VFp(2));
|
|
}
|
|
}
|
|
VertexIterator vi;
|
|
for (vi=m.vert.begin(); vi!=m.vert.end(); ++vi)
|
|
if(!(*vi).IsD())
|
|
{
|
|
if(VertexType::HasVFAdjacency())
|
|
if ((*vi).VFp()!=0)
|
|
pu.Update((*vi).VFp());
|
|
}
|
|
|
|
}
|
|
// e poiche' lo spazio e' cambiato si ricalcola anche last da zero
|
|
unsigned int siz=m.face.size()-n;
|
|
|
|
last = m.face.begin();
|
|
advance(last,siz);
|
|
return last;
|
|
}
|
|
|
|
|
|
/** Function to add n faces to the mesh.
|
|
@param n Il numero di facce che si vuole aggiungere alla mesh
|
|
*/
|
|
static FaceIterator AddFaces(MeshType &m, int n)
|
|
{
|
|
PointerUpdater<FacePointer> pu;
|
|
return AddFaces(m,n,pu);
|
|
}
|
|
/** Function to add n faces to the mesh.
|
|
NOTA: Aggiorna fn;
|
|
*/
|
|
static FaceIterator AddFaces(MeshType &m, int n, PointerUpdater<FacePointer> &pu)
|
|
{
|
|
FaceIterator last;
|
|
pu.Clear();
|
|
if(m.face.empty()) {
|
|
pu.oldBase=0; // if the vector is empty we cannot find the last valid element
|
|
} else {
|
|
pu.oldBase=&*m.face.begin();
|
|
last=m.face.end();
|
|
}
|
|
|
|
m.face.resize(m.face.size()+n);
|
|
/* for(int i=0; i<n; ++i)
|
|
{
|
|
m.face.push_back(FaceType());
|
|
m.face.back().ClearFlags();
|
|
}*/
|
|
|
|
m.fn+=n;
|
|
|
|
pu.newBase = &*m.face.begin();
|
|
|
|
if(pu.NeedUpdate())
|
|
{
|
|
FaceIterator fi;
|
|
for (fi=m.face.begin(); fi!=m.face.end(); ++fi)
|
|
if(!(*fi).IsD())
|
|
{
|
|
if(FaceType::HasFFAdjacency())
|
|
{
|
|
if ((*fi).cFFp(0)!=0) pu.Update((*fi).FFp(0));
|
|
if ((*fi).cFFp(1)!=0) pu.Update((*fi).FFp(1));
|
|
if ((*fi).cFFp(2)!=0) pu.Update((*fi).FFp(2));
|
|
}
|
|
if(FaceType::HasVFAdjacency())
|
|
{
|
|
//update pointers to chain of face incident in a vertex
|
|
//update them only if they are different from zero
|
|
if ((*fi).cVFp(0)!=0) pu.Update((*fi).VFp(0));
|
|
if ((*fi).cVFp(1)!=0) pu.Update((*fi).VFp(1));
|
|
if ((*fi).cVFp(2)!=0) pu.Update((*fi).VFp(2));
|
|
}
|
|
}
|
|
VertexIterator vi;
|
|
for (vi=m.vert.begin(); vi!=m.vert.end(); ++vi)
|
|
if(!(*vi).IsD())
|
|
{
|
|
if(VertexType::HasVFAdjacency())
|
|
if ((*vi).cVFp()!=0)
|
|
pu.Update((FaceType * &)(*vi).VFp());
|
|
// Note the above cast is probably not useful if you have correctly defined
|
|
// your vertex type with the correct name of the facetype as a template argument;
|
|
// pu.Update((FaceType*)(*vi).VFp()); compiles on old gcc and borland
|
|
// pu.Update((*vi).VFp()); compiles on .net and newer gcc
|
|
|
|
|
|
}
|
|
// e poiche' lo spazio e' cambiato si ricalcola anche last da zero
|
|
|
|
}
|
|
unsigned int siz=(unsigned int)m.face.size()-n;
|
|
last = m.face.begin();
|
|
advance(last,siz);
|
|
return last;
|
|
}
|
|
|
|
}; // end class
|
|
/*@}*/
|
|
} // End Namespace TriMesh
|
|
} // End Namespace vcg
|
|
|
|
#endif
|