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
|
/*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration |
\\ / A nd | Copyright (C) 2011-2016 OpenFOAM Foundation
\\/ M anipulation |
-------------------------------------------------------------------------------
License
This file is part of OpenFOAM.
OpenFOAM 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 3 of the License, or
(at your option) any later version.
OpenFOAM 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
for more details.
You should have received a copy of the GNU General Public License
along with OpenFOAM. If not, see <http://www.gnu.org/licenses/>.
Application
surfaceCoarsen
Description
Surface coarsening using 'bunnylod':
Polygon Reduction Demo
By Stan Melax (c) 1998
mailto:melax@cs.ualberta.ca
http://www.cs.ualberta.ca/~melax
\*---------------------------------------------------------------------------*/
#include "argList.H"
#include "fileName.H"
#include "triSurface.H"
#include "OFstream.H"
#include "triFace.H"
#include "triFaceList.H"
// From bunnylod
#include "progmesh.h"
using namespace Foam;
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
int mapVertex(::List<int>& collapse_map, int a, int mx)
{
if (mx <= 0)
{
return 0;
}
while (a >= mx)
{
a = collapse_map[a];
}
return a;
}
int main(int argc, char *argv[])
{
argList::noParallel();
argList::validArgs.append("surfaceFile");
argList::validArgs.append("reductionFactor");
argList::validArgs.append("output surfaceFile");
argList args(argc, argv);
const fileName inFileName = args[1];
const scalar reduction = args.argRead<scalar>(2);
const fileName outFileName = args[3];
if (reduction <= 0 || reduction > 1)
{
FatalErrorInFunction
<< "Reduction factor " << reduction
<< " should be within 0..1" << endl
<< "(it is the reduction in number of vertices)"
<< exit(FatalError);
}
Info<< "Input surface :" << inFileName << endl
<< "Reduction factor:" << reduction << endl
<< "Output surface :" << outFileName << endl << endl;
const triSurface surf(inFileName);
Info<< "Surface:" << endl;
surf.writeStats(Info);
Info<< endl;
::List< ::Vector> vert; // global list of vertices
::List< ::tridata> tri; // global list of triangles
// Convert triSurface to progmesh format. Note: can use global point
// numbering since surface read in from file.
const pointField& pts = surf.points();
forAll(pts, ptI)
{
const point& pt = pts[ptI];
vert.Add( ::Vector(pt.x(), pt.y(), pt.z()));
}
forAll(surf, facei)
{
const labelledTri& f = surf[facei];
tridata td;
td.v[0]=f[0];
td.v[1]=f[1];
td.v[2]=f[2];
tri.Add(td);
}
::List<int> collapse_map; // to which neighbor each vertex collapses
::List<int> permutation;
::ProgressiveMesh(vert,tri,collapse_map,permutation);
// rearrange the vertex list
::List< ::Vector> temp_list;
for (int i=0;i<vert.num;i++)
{
temp_list.Add(vert[i]);
}
for (int i=0;i<vert.num;i++)
{
vert[permutation[i]]=temp_list[i];
}
// update the changes in the entries in the triangle list
for (int i=0;i<tri.num;i++)
{
for (int j=0;j<3;j++)
{
tri[i].v[j] = permutation[tri[i].v[j]];
}
}
// Only get triangles with non-collapsed edges.
int render_num = int(reduction * surf.nPoints());
Info<< "Reducing to " << render_num << " vertices" << endl;
// Storage for new surface.
Foam::List<labelledTri> newTris(surf.size());
label newI = 0;
for (int i=0; i<tri.num; i++)
{
int p0 = mapVertex(collapse_map, tri[i].v[0], render_num);
int p1 = mapVertex(collapse_map, tri[i].v[1], render_num);
int p2 = mapVertex(collapse_map, tri[i].v[2], render_num);
// note: serious optimization opportunity here,
// by sorting the triangles the following "continue"
// could have been made into a "break" statement.
if (p0 == p1 || p1 == p2 || p2 == p0)
{
continue;
}
newTris[newI++] = labelledTri(p0, p1, p2, 0);
}
newTris.setSize(newI);
// Convert vert into pointField.
pointField newPoints(vert.num);
for (int i=0; i<vert.num; i++)
{
const ::Vector & v = vert[i];
newPoints[i] = point(v.x, v.y, v.z);
}
triSurface surf2(newTris, newPoints);
triSurface outSurf
(
surf2.localFaces(),
surf2.patches(),
surf2.localPoints()
);
Info<< "Coarsened surface:" << endl;
surf2.writeStats(Info);
Info<< endl;
Info<< "Writing to file " << outFileName << endl << endl;
surf2.write(outFileName);
Info<< "End\n" << endl;
return 0;
}
// ************************************************************************* //
|
