1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
|
/****************************************************************************
* VCGLib o o *
* Visual and Computer Graphics Library o o *
* _ O _ *
* Copyright(C) 2004-2016 \/)\/ *
* 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. *
* *
****************************************************************************/
#ifndef __VCGLIB_POLYGON_SUPPORT
#define __VCGLIB_POLYGON_SUPPORT
#include <vcg/simplex/face/jumping_pos.h>
#include <vcg/space/planar_polygon_tessellation.h>
namespace vcg {
namespace tri {
/// \ingroup trimesh
/// \headerfile polygon_support.h vcg/complex/algorithms/polygon_support.h
/// \brief This class is used convert between polygonal meshes and triangular meshes
/**
This class contains two members that allow to build a triangular mesh from a polygonal mesh
and viceversa. In a trimesh, the generic polygons with n sides are codified represented by
tagging the internal edge of the face as 'faux' with the SetF.
*/
template <class TriMeshType,class PolyMeshType >
class PolygonSupport{
typedef typename TriMeshType::FaceIterator TriFaceIterator;
typedef typename PolyMeshType::FaceIterator PolyFaceIterator;
typedef typename TriMeshType::VertexIterator TriVertexIterator;
typedef typename PolyMeshType::VertexIterator PolyVertexIterator;
typedef typename TriMeshType::CoordType::ScalarType Scalar;
public:
/**
Given a tri mesh (with per-face normals and FF connectivity),
merges flat faces into larger polygons.
The merging is done only by setting the faux bit
**/
static void MergeFlatFaces(TriMeshType & tm, double tolerance = 0.1E-4)
{
typedef typename TriMeshType::FaceType FaceType;
Scalar minDist = 1 - Scalar(tolerance);
for (TriFaceIterator fi=tm.face.begin(); fi!=tm.face.end(); fi++) {
FaceType *fa = &*fi;
for (int w=0; w<3; w++) {
FaceType *fb = fa->FFp(w);
if ( (fb>fa) && (fa->N()*fb->N() > minDist) ) {
fa->SetF( w );
fb->SetF( fa->FFi(w) ); // reciprocate
}
}
}
}
/**
Import a trianglemesh from a polygon mesh
**/
static void ImportFromPolyMesh(TriMeshType & tm, PolyMeshType & pm)
{
tri::RequirePolygonalMesh(pm);
std::vector<typename PolyMeshType::CoordType> points;
// the vertices are the same, simply import them
PolyVertexIterator vi;
TriVertexIterator tvi = Allocator<TriMeshType>::AddVertices(tm,pm.vert.size());
int cnt = 0;
for(tvi = tm.vert.begin(),vi = pm.vert.begin(); tvi != tm.vert.end(); ++tvi,++vi,++cnt)
if(!(*vi).IsD()) (*tvi).ImportData(*vi); else tri::Allocator<TriMeshType>::DeleteVertex(tm,(*tvi));
for(PolyFaceIterator fi = pm.face.begin(); fi != pm.face.end(); ++fi)
{
if(!((*fi).IsD())){
points.clear();
for(int i = 0; i < (*fi).VN(); ++i) {
typename PolyMeshType::VertexType * v = (*fi).V(i);
points.push_back(v->P());
}
std::vector<int> faces;
TessellatePlanarPolygon3(points,faces);
for(size_t i = 0; i<faces.size();i+=3){
TriFaceIterator tfi = Allocator<TriMeshType>::AddFace(tm,
tri::Index(pm,(*fi).V( faces[i+0] )),
tri::Index(pm,(*fi).V( faces[i+1] )),
tri::Index(pm,(*fi).V( faces[i+2] )) );
tfi->ImportData(*fi);
// set the F flags
if( (faces[i ]+1)%points.size() != size_t(faces[i+1])) (*tfi).SetF(0);
if( (faces[i+1]+1)%points.size() != size_t(faces[i+2])) (*tfi).SetF(1);
if( (faces[i+2]+1)%points.size() != size_t(faces[i ])) (*tfi).SetF(2);
}
}
}
}
/**
\brief Import a polygon mesh from a triangle mesh
It assumes that the mesh has the faux edges bit set for a polygonal mesh and that have the FFAdjacency already computed.
**/
static void ImportFromTriMesh( PolyMeshType & pm, TriMeshType & tm)
{
tri::RequirePolygonalMesh(pm);
tri::RequireTriangularMesh(tm);
tri::RequireCompactness(tm);
tri::RequireFFAdjacency(tm);
tri::UpdateFlags<TriMeshType>::FaceClearV(tm);
// the vertices are the same, simply import them
int cnt = 0;
typename TriMeshType ::ConstVertexIterator tvi;
typename PolyMeshType::VertexIterator vi = tri::Allocator<PolyMeshType>::AddVertices(pm,tm.vert.size());
for(tvi = tm.vert.begin(); tvi != tm.vert.end(); ++tvi,++vi,++cnt)
(*vi).ImportData(*tvi);
// convert the faces
typename TriMeshType::FaceIterator tfi;
face::JumpingPos<typename TriMeshType::FaceType> p;
for( tfi = tm.face.begin(); tfi != tm.face.end(); ++tfi) if(!(*tfi).IsV())
{
std::vector<typename TriMeshType::VertexPointer> vs;// vertices of the polygon
ExtractPolygon(&*tfi,vs);
std::reverse(vs.begin(),vs.end());
//now vs contains all the vertices of the polygon (still in the trimesh)
if (vs.size()==0)continue;
typename PolyMeshType::FaceIterator pfi = tri::Allocator<PolyMeshType>::AddFaces(pm,1);
(*pfi).Alloc(vs.size());
for(size_t i = 0 ; i < vs.size(); ++i)
(*pfi).V(i) = ( typename PolyMeshType::VertexType*) & pm.vert[vs[i]-&(*tm.vert.begin())];
if(tri::HasPerFaceColor(tm) && tri::HasPerFaceColor(pm)) pfi->C()=tfi->C();
if(tri::HasPerFaceQuality(tm) && tri::HasPerFaceQuality(pm)) pfi->Q()=tfi->Q();
}
}
/// \brief Collect tris and verts of a polygonal face marked by FauxEdges
///
/// Given a face pointer, it builds a vector with all the face and vertex pointers
/// around the polygonal face determined by the current FAUX-EDGE markings.
/// It assumes that the mesh is 2Manifold and has FF adjacency already computed
/// per face visited flag cleared.
/// NOTE: All the faces touched are marked as visited and it assumes that you
/// do not call this function on a visited face.
static void ExtractPolygon(typename TriMeshType::FacePointer tfp,
std::vector<typename TriMeshType::VertexPointer> &vs,
std::vector<typename TriMeshType::FacePointer> &fs)
{
vs.clear();
fs.clear();
if(tfp->IsV()) return;
// all faux edges return an empty vertex vector!
if( tfp->IsF(0) && tfp->IsF(1) && tfp->IsF(2)) return;
// all NON faux edges just return triangle!
if((!tfp->IsF(0)) && (!tfp->IsF(1)) && (!tfp->IsF(2)))
{
vs.push_back(tfp->V(0)); vs.push_back(tfp->V(1)); vs.push_back(tfp->V(2));
fs.push_back(tfp);
return;
}
// find a non faux edge
int se = -1;
for(int i=0; i<3; i++) if (!( tfp->IsF(i))) { se = i; break;}
assert(se !=-1);
// initialize a pos on the first non faux edge
face::Pos<typename TriMeshType::FaceType> start(tfp,se,tfp->V(se));
face::Pos<typename TriMeshType::FaceType> p(start);
fs.push_back(p.F());
p.F()->SetV();
do
{
assert(!p.F()->IsF(p.E()));
vs.push_back(p.V());
p.FlipE();
while( p.F()->IsF(p.E()) )
{
p.FlipF();
if(!p.F()->IsV()) {
fs.push_back(p.F());
p.F()->SetV();
}
p.FlipE();
}
p.FlipV();
} while(p!=start);
//assert(vs.size() == fs.size()+2);
}
static void ExtractPolygon(typename TriMeshType::FacePointer tfp, std::vector<typename TriMeshType::VertexPointer> &vs)
{
std::vector<typename TriMeshType::FacePointer> fs;
ExtractPolygon(tfp,vs,fs);
}
}; // end of struct
}} // end namespace tri
#endif // __VCGLIB_TRI_CLIP
|
