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
|
// -------------------------------------------------------------------
// MAdLib - Copyright (C) 2008-2009 Universite catholique de Louvain
//
// See the Copyright.txt and License.txt files for license information.
// You should have received a copy of these files along with MAdLib.
// If not, see <http://www.madlib.be/license/>
//
// Please report all bugs and problems to <contrib@madlib.be>
//
// Authors: Gaetan Compere, Jean-Francois Remacle
// -------------------------------------------------------------------
#include "RegionRemoveOp.h"
#include "CallbackManager.h"
namespace MAd {
// -------------------------------------------------------------------
bool regionRemoveOp::checkConstraints() const
{
return true;
}
// -------------------------------------------------------------------
bool regionRemoveOp::checkGeometry()
{
// deny if a vertex is classified on a geometrical edge or vertex
int nbClassVerts = 0;
pPList rVerts = R_vertices(region);
void * temp = NULL;
while ( pVertex vert = (pVertex) PList_next(rVerts,&temp) ) {
if ( EN_whatInType((pEntity)vert) < 2 ) nbClassVerts++;
}
PList_delete(rVerts);
if ( nbClassVerts != 0 ) return false;
// deny if an edge is classified on a geometrical edge
int nbClassEdges = 0;
pPList rEdges = R_edges(region);
void * temp2 = NULL;
while ( pEdge edge = (pEdge) PList_next(rEdges,&temp2) ) {
if ( EN_whatInType((pEntity)edge) < 2 ) nbClassEdges++;
}
PList_delete(rEdges);
if ( nbClassEdges != 0 ) return false;
int nbExternalFaces = 0;
for (int iF=0; iF < 4; iF++) {
pFace face = R_face(region,iF);
// see which faces will be deleted
if ( F_numRegions(face) == 1 ) {
nbExternalFaces++;
delFace[iF] = true;
}
else {
delFace[iF] = false;
}
// see on which geometric entity the new
// boundary faces will be classified
pGEntity pGE = EN_whatIn((pEntity)face);
if ( GEN_type(pGE) == 2 ) {
classifyFaces = true;
geoFace = pGE;
}
}
// ensure not to create a hole in a volume
if ( nbExternalFaces == 0 ) return false;
return false;
}
// -------------------------------------------------------------------
bool regionRemoveOp::evaluateShapes()
{
double worstShape = mqm.getElementEvaluator()->bestShapeEver();
results->setWorstShape( worstShape );
return true;
}
// -------------------------------------------------------------------
void regionRemoveOp::evaluateLengths() const
{
results->setMinLenSq(1.);
results->setMaxLenSq(1.);
}
// -------------------------------------------------------------------
void regionRemoveOp::apply()
{
// --- classify faces ---
if (classifyFaces) {
for (int iF=0; iF < 4; iF++) {
if ( delFace[iF] == false ) {
pFace face = R_face(region,iF);
F_setWhatIn(face,geoFace);
}
}
}
// --- list faces to delete ---
pPList delF = PList_new();
for (int iF=0; iF < 4; iF++) {
if ( delFace[iF] == true ) PList_append(delF,(pEntity)R_face(region,iF));
}
// --- list edges to delete ---
pPList delE = PList_new();
pPList rEdges = R_edges(region);
void * temp = NULL;
while ( pEdge edge = (pEdge) PList_next(rEdges,&temp) ) {
bool toDel = true;
pPList eFaces = E_faces(edge);
void * temp2 = NULL;
while ( pFace face = (pFace) PList_next(eFaces,&temp2) ) {
if ( !PList_inList(delF,(pEntity)face) ) { toDel = false; break; }
}
PList_delete(eFaces);
if (toDel) PList_append(delE,(pEntity)edge);
}
PList_delete(rEdges);
// --- list vertices to delete ---
pPList delV = PList_new();
pPList rVerts = R_vertices(region);
void * temp3 = NULL;
while ( pVertex vert = (pVertex) PList_next(rVerts,&temp3) ) {
bool toDel = true;
pPList vEdges = V_edges(vert);
void * temp4 = NULL;
while ( pEdge edge = (pEdge) PList_next(vEdges,&temp4) ) {
if ( !PList_inList(delE,(pEntity)edge) ) { toDel = false; break; }
}
if (toDel) PList_append(delV,(pEntity)vert);
}
PList_delete(rVerts);
// --- call callback functions ---
pPList emptyList;
pPList delEn = PList_new();
void * delTmp = NULL;
while ( pFace face = (pFace) PList_next(delF,&delTmp) ) PList_append(delEn,(pEntity)face);
delTmp = NULL;
while ( pEdge edge = (pEdge) PList_next(delE,&delTmp) ) PList_append(delEn,(pEntity)edge);
delTmp = NULL;
while ( pVertex vert = (pVertex) PList_next(delV,&delTmp) ) PList_append(delEn,(pEntity)vert);
CallBackManagerSgl::instance().callCallBacks(delEn,
emptyList,
MAd_RREMOVE,
(pEntity)region);
PList_delete(delEn);
// --- delete entities ---
M_removeRegion(mesh,region);
void * delTmp2 = NULL;
while ( pFace face = (pFace) PList_next(delF,&delTmp2) ) {
M_removeFace(mesh,face);
}
delTmp2 = NULL;
while ( pEdge edge = (pEdge) PList_next(delE,&delTmp2) ) {
M_removeEdge(mesh,edge);
}
delTmp2 = NULL;
while ( pVertex vertex = (pVertex) PList_next(delV,&delTmp2) ) {
M_removeVertex(mesh,vertex);
}
PList_delete(delF);
PList_delete(delE);
PList_delete(delV);
HistorySgl::instance().add((int)type(),OPERATOR_APPLY,1);
}
// -------------------------------------------------------------------
}
|
