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
|
/****************************************************************************
* 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 EXTRUDE_H
#define EXTRUDE_H
namespace vcg {
namespace tri {
template <class MeshType> class Extrude
{
public:
typedef typename MeshType::FacePointer FacePointer;
typedef typename MeshType::EdgePointer EdgePointer;
typedef typename MeshType::VertexPointer VertexPointer;
typedef typename MeshType::FaceType FaceType;
typedef typename MeshType::EdgeType EdgeType;
typedef typename MeshType::VertexIterator VertexIterator;
typedef typename MeshType::EdgeIterator EdgeIterator;
typedef typename MeshType::FaceIterator FaceIterator;
static void ProfileWithCap(MeshType &profile, MeshType &fullSurface, const vcg::Similarityf &sim )
{
fullSurface.Clear();
MeshType lowCapSurf,topCapSurf;
ProfileWithCap(profile,fullSurface,lowCapSurf,topCapSurf,sim);
tri::Append<MeshType,MeshType>::Mesh(fullSurface,lowCapSurf);
tri::Append<MeshType,MeshType>::Mesh(fullSurface,topCapSurf);
tri::Clean<MeshType>::RemoveDuplicateVertex(fullSurface);
bool oriented,orientable;
tri::UpdateTopology<MeshType>::FaceFace(fullSurface);
tri::Clean<MeshType>::OrientCoherentlyMesh(fullSurface,oriented,orientable);
}
static void ProfileWithCap(MeshType &profile, MeshType &sideSurf, MeshType &lowCapSurf, MeshType &topCapSurf, const vcg::Similarityf &sim )
{
sideSurf.Clear();
lowCapSurf.Clear();
topCapSurf.Clear();
for(VertexIterator vi=profile.vert.begin();vi!=profile.vert.end();++vi)
{
VertexIterator vp=tri::Allocator<MeshType>::AddVertices(sideSurf,2);
vp->P()=vi->P();
++vp;
vp->P()= sim*vi->P() ;
}
for(EdgeIterator ei=profile.edge.begin();ei!=profile.edge.end();++ei)
{
int i0=tri::Index(profile,ei->V(0));
int i1=tri::Index(profile,ei->V(1));
FaceIterator fp= tri::Allocator<MeshType>::AddFaces(sideSurf,2);
fp->V(0) = &sideSurf.vert[i0*2];
fp->V(1) = &sideSurf.vert[i1*2];
fp->V(2) = &sideSurf.vert[i0*2+1];
++fp;
fp->V(0) = &sideSurf.vert[i1*2+1];
fp->V(1) = &sideSurf.vert[i0*2+1];
fp->V(2) = &sideSurf.vert[i1*2];
}
tri::CapEdgeMesh(profile,lowCapSurf);
if(lowCapSurf.fn==0) CapEdgeMesh(profile,lowCapSurf,true);
tri::Append<MeshType,MeshType>::Mesh(topCapSurf,lowCapSurf);
for(VertexIterator vi=topCapSurf.vert.begin();vi!=topCapSurf.vert.end();++vi)
vi->P() = sim*vi->P();
// tri::Append<MeshType,MeshType>::Mesh(sideSurf,lowCapSurf);
}
static void ProfileWithCap(MeshType &profile, MeshType &surface, const Point3f offset)
{
Similarityf tra;
tra.SetTranslate(offset);
ProfileWithCap(profile,surface,tra);
}
}; // end class
} // end namespace tri
} // end namespace vcg
#endif // EXTRUDE_H
|
