Newer
Older
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
/*---------------------------------------------------------------------------*\
========= |
\\ / F ield | cfMesh: A library for mesh generation
\\ / O peration |
\\ / A nd | Author: Franjo Juretic (franjo.juretic@c-fields.com)
\\/ M anipulation | Copyright (C) Creative Fields, Ltd.
-------------------------------------------------------------------------------
License
This file is part of cfMesh.
cfMesh 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.
cfMesh 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 cfMesh. If not, see <http://www.gnu.org/licenses/>.
Description
\*---------------------------------------------------------------------------*/
#include "sortEdgesIntoChains.H"
#include "helperFunctions.H"
#include "Map.H"
//#define DEBUGSort
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
namespace Foam
{
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
void sortEdgesIntoChains::createNodeLabels()
{
label nPoints(0);
forAll(bEdges_, eI)
{
const edge& e = bEdges_[eI];
if( !newNodeLabel_.found(e.start()) )
newNodeLabel_.insert(e.start(), nPoints++);
if( !newNodeLabel_.found(e.end()) )
newNodeLabel_.insert(e.end(), nPoints++);
}
edgesAtPoint_.setSize(nPoints);
forAll(bEdges_, eI)
{
const edge& e = bEdges_[eI];
label l = newNodeLabel_[e.start()];
edgesAtPoint_[l].append(eI);
l = newNodeLabel_[e.end()];
edgesAtPoint_[l].append(eI);
}
forAll(edgesAtPoint_, pI)
if( edgesAtPoint_[pI].size() % 2 )
openEdges_ = true;
}
bool sortEdgesIntoChains::findPointsBelongingToTheChain
(
const label currPos,
DynList<bool>& chainEdges
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
) const
{
# ifdef DEBUGSort
Info << "Finding point belonging to a chain" << endl;
# endif
chainEdges.setSize(bEdges_.size());
chainEdges = false;
if( edgesAtPoint_[currPos].size() != 2 )
return false;
const label commonVrt =
bEdges_[edgesAtPoint_[currPos][0]].commonVertex
(
bEdges_[edgesAtPoint_[currPos][1]]
);
label prevVrt = bEdges_[edgesAtPoint_[currPos][0]].otherVertex(commonVrt);
label nextVrt = bEdges_[edgesAtPoint_[currPos][1]].otherVertex(commonVrt);
forAll(edgesAtPoint_[currPos], posI)
chainEdges[edgesAtPoint_[currPos][posI]] = true;
# ifdef DEBUGSort
Info << "commonVrt " << commonVrt << endl;
Info << "prevVrt " << prevVrt << endl;
Info << "nextVrt " << nextVrt << endl;
# endif
bool found;
do
{
found = false;
const DynList<label>& vEdges = edgesAtPoint_[newNodeLabel_[prevVrt]];
if( vEdges.size() == 2 )
{
forAll(vEdges, eI)
if( !chainEdges[vEdges[eI]] )
{
found = true;
chainEdges[vEdges[eI]] = true;
prevVrt = bEdges_[vEdges[eI]].otherVertex(prevVrt);
}
}
} while( found );
do
{
found = false;
const DynList<label>& vEdges = edgesAtPoint_[newNodeLabel_[nextVrt]];
if( vEdges.size() == 2 )
{
forAll(vEdges, eI)
if( !chainEdges[vEdges[eI]] )
{
found = true;
chainEdges[vEdges[eI]] = true;
nextVrt = bEdges_[vEdges[eI]].otherVertex(nextVrt);
}
}
} while( found );
if(
(edgesAtPoint_[newNodeLabel_[nextVrt]].size() != 2) &&
(edgesAtPoint_[newNodeLabel_[prevVrt]].size() != 2) &&
(prevVrt != nextVrt)
)
{
chainEdges = false;
return false;
}
# ifdef DEBUGSort
Info << "Chain edges " << chainEdges << endl;
# endif
return true;
}
void sortEdgesIntoChains::shrinkEdges(const DynList<bool>& chainEdges)
{
forAll(chainEdges, eI)
if( chainEdges[eI] )
{
const edge& e = bEdges_[eI];
edgesAtPoint_[newNodeLabel_[e.start()]].removeElement
(
edgesAtPoint_[newNodeLabel_[e.start()]].containsAtPosition(eI)
);
edgesAtPoint_[newNodeLabel_[e.end()]].removeElement
(
edgesAtPoint_[newNodeLabel_[e.end()]].containsAtPosition(eI)
);
}
}
void sortEdgesIntoChains::createChainFromEdges(const DynList<bool>& chainEdges)
DynList<label> chainPoints(i);
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
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
i = 0;
forAll(chainEdges, eI)
if( chainEdges[eI] )
{
chainPoints[i++] = bEdges_[eI].start();
chainPoints[i++] = bEdges_[eI].end();
# ifdef DEBUGSort
Info << "Init chainPoints " << chainPoints << endl;
# endif
bool found;
do
{
# ifdef DEBUGSort
Info << "Iteration " << label(i-1) << endl;
# endif
found = false;
const DynList<label>& pEdges =
edgesAtPoint_[newNodeLabel_[chainPoints[i-1]]];
forAll(pEdges, peI)
if( chainEdges[pEdges[peI]] )
{
const label otherPoint =
bEdges_[pEdges[peI]].otherVertex(chainPoints[i-1]);
# ifdef DEBUGSort
Info << "Other point " << otherPoint << endl;
# endif
if( otherPoint == -1 )
continue;
if( chainPoints[i-2] == otherPoint )
continue;
if( chainPoints[0] == otherPoint )
continue;
found = true;
chainPoints[i++] = otherPoint;
}
} while( found );
createdChains_.append(chainPoints);
break;
}
}
void sortEdgesIntoChains::sortEdges()
{
createNodeLabels();
if( !openEdges_ )
{
DynList<bool> chainEdges(bEdges_.size());
forAll(edgesAtPoint_, pI)
if( findPointsBelongingToTheChain(pI, chainEdges) )
{
createChainFromEdges(chainEdges);
shrinkEdges(chainEdges);
}
}
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *//
sortEdgesIntoChains::sortEdgesIntoChains(const DynList<edge>& bEdges)
:
bEdges_(bEdges),
openEdges_(false),
newNodeLabel_(),
edgesAtPoint_(),
createdChains_()
{
sortEdges();
}
sortEdgesIntoChains::~sortEdgesIntoChains()
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *//
// Member functions
const DynList<DynList<label> >& sortEdgesIntoChains::sortedChains() const