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
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277 | #include "meshkit/MergeMesh.hpp"
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <string>
#include <vector>
#include <cassert>
#include <iostream>
#include "moab/Skinner.hpp"
#include "moab/AdaptiveKDTree.hpp"
#include "moab/Range.hpp"
#include "moab/CartVect.hpp"
namespace MeshKit
{
// static registration of this mesh scheme
moab::EntityType MergeMesh_tps[] = { moab::MBVERTEX,
moab::MBEDGE,
moab::MBTRI,
moab::MBHEX,
moab::MBMAXTYPE};
const moab::EntityType* MergeMesh::output_types()
{ return MergeMesh_tps; }
MergeMesh::MergeMesh(MKCore *mkcore, const MEntVector &me_vec)<--- Member variable 'MergeMesh::mergeTolSq' is not initialized in the constructor.
: MeshScheme(mkcore, me_vec),
imeshImpl(mkcore->imesh_instance()), mbImpl (mkcore->moab_instance())
{
mergeTol = 1e-4;
updateSets = 0;
doMerge = 1;
mergeTag = NULL;
}
MergeMesh::~MergeMesh()
{
if (mbMergeTag) mbImpl->tag_delete(mbMergeTag);
}
bool MergeMesh::add_modelent(ModelEnt *model_ent)
{
return MeshOp::add_modelent(model_ent);
}
void MergeMesh::set_merge_params(double merge_tol, int updatesets,
int domerge, iBase_TagHandle merge_tag)
{
mergeTol = merge_tol;
updateSets = updatesets;
doMerge = domerge;
mergeTag = merge_tag;
}
void MergeMesh::setup_this()
{
std::cout << "IN SETUPTHIS MERGEMESH " << std::endl;
}
void MergeMesh::execute_this()
{
std::cout << "IN EXTHIS MERGEMESH " << std::endl;
std::vector<iBase_EntityHandle> ents(mentSelection.size());
int dim = 3;
for (MEntSelection::iterator mit = mentSelection.begin();
mit != mentSelection.end(); mit++) {<--- Prefer prefix ++/-- operators for non-primitive types.
ModelEnt *me = mit->first;
dim = me->dimension();
}
if(dim == 3){
imeshImpl->getEntities(0, iBase_REGION, iMesh_ALL_TOPOLOGIES,
ents);
}
else if (dim == 2){
imeshImpl->getEntities(0, iBase_FACE, iMesh_ALL_TOPOLOGIES,
ents);
}
merge_entities(&ents[0], ents.size(), mergeTol, doMerge, updateSets,
mergeTag);
}
void MergeMesh::merge_entities(iBase_EntityHandle *elems,
int elems_size,
const double merge_tol,
const int do_merge,
const int update_sets,
iBase_TagHandle merge_tag)
{
mergeTol = merge_tol;
mergeTolSq = merge_tol*merge_tol;
moab::Range tmp_elems;
tmp_elems.insert((moab::EntityHandle*)elems, (moab::EntityHandle*)elems + elems_size);
moab::ErrorCode result = merge_entities(tmp_elems, do_merge, update_sets,
(moab::Tag)merge_tag);
if (moab::MB_SUCCESS != result)
exit(0);
}
void MergeMesh::perform_merge(iBase_TagHandle merge_tag)
{
// put into a range
moab::ErrorCode result = perform_merge((moab::Tag) merge_tag);
if (moab::MB_SUCCESS != result)
exit(0);
}
moab::ErrorCode MergeMesh::merge_entities(moab::Range &elems,
const int do_merge,
const int update_sets,
moab::Tag merge_tag)
{
// get the skin of the entities
moab::Skinner skinner(mbImpl);
moab::Range skin_range;
moab::ErrorCode result = skinner.find_skin(0, elems, 0, skin_range);
if (moab::MB_SUCCESS != result) return result;
// create a tag to mark merged-to entity; reuse tree_root
moab::EntityHandle tree_root = 0;
if (0 == merge_tag) {
//result = mbImpl->tag_create("__merge_tag", sizeof(moab::EntityHandle),
// MB_TAG_DENSE, MB_TYPE_HANDLE,
// mbMergeTag, &tree_root);
result = mbImpl->tag_get_handle("__merge_tag", 1, moab::MB_TYPE_HANDLE,
mbMergeTag, moab::MB_TAG_DENSE|moab::MB_TAG_CREAT,
&tree_root);
if (moab::MB_SUCCESS != result) return result;
}
else mbMergeTag = merge_tag;
// build a kd tree with the vertices
moab::AdaptiveKDTree kd(mbImpl);
result = kd.build_tree(skin_range, &tree_root);
if (moab::MB_SUCCESS != result) return result;
// find matching vertices, mark them
result = find_merged_to(kd, tree_root, mbMergeTag);
if (moab::MB_SUCCESS != result) return result;
// merge them if requested
if (do_merge) {
result = perform_merge(mbMergeTag);
if (moab::MB_SUCCESS != result) return result;
}
return moab::MB_SUCCESS;
}
moab::ErrorCode MergeMesh::perform_merge(moab::Tag merge_tag)
{
if (deadEnts.size()==0){
std::cout << "\nWarning: Geometries don't have a common face; Nothing to merge" << std::endl;
return moab::MB_SUCCESS; //nothing to merge carry on with the program
}
if (mbImpl->type_from_handle(*deadEnts.rbegin()) != moab::MBVERTEX)
return moab::MB_FAILURE;
std::vector<moab::EntityHandle> merge_tag_val(deadEnts.size());
moab::ErrorCode result = mbImpl->tag_get_data(merge_tag, deadEnts, &merge_tag_val[0]);
if (moab::MB_SUCCESS != result) return result;
moab::Range::iterator rit;
unsigned int i;
for (rit = deadEnts.begin(), i = 0; rit != deadEnts.end(); rit++, i++) {<--- Prefer prefix ++/-- operators for non-primitive types.
assert(merge_tag_val[i]);
result = mbImpl->merge_entities(merge_tag_val[i], *rit, false, false);
if (moab::MB_SUCCESS != result) return result;
}
return mbImpl->delete_entities(deadEnts);
}
moab::ErrorCode MergeMesh::find_merged_to(moab::AdaptiveKDTree & tree, moab::EntityHandle &tree_root, moab::Tag merge_tag)
{
moab::AdaptiveKDTreeIter iter;
//moab::AdaptiveKDTree tree(mbImpl);
// evaluate vertices in this leaf
moab::Range leaf_range, leaf_range2;
std::vector<moab::EntityHandle> sorted_leaves;
std::vector<double> coords;
std::vector<moab::EntityHandle> merge_tag_val, leaves_out;
moab::ErrorCode result = tree.get_tree_iterator(tree_root, iter);
if (moab::MB_SUCCESS != result) return result;
while (result == moab::MB_SUCCESS) {
sorted_leaves.push_back( iter.handle() );
result = iter.step();
}
if (result != moab::MB_ENTITY_NOT_FOUND)
return result;
std::sort( sorted_leaves.begin(), sorted_leaves.end() );
std::vector<moab::EntityHandle>::iterator it;
for (it = sorted_leaves.begin(); it != sorted_leaves.end(); ++it) {
leaf_range.clear();
result = mbImpl->get_entities_by_handle(*it, leaf_range);
if (moab::MB_SUCCESS != result) return result;
coords.resize(3*leaf_range.size());
merge_tag_val.resize(leaf_range.size());
result = mbImpl->get_coords(leaf_range, &coords[0]);
if (moab::MB_SUCCESS != result) return result;
result = mbImpl->tag_get_data(merge_tag, leaf_range, &merge_tag_val[0]);
if (moab::MB_SUCCESS != result) return result;
moab::Range::iterator rit;
unsigned int i;
bool inleaf_merged, outleaf_merged = false;
unsigned int lr_size = leaf_range.size();
for (i = 0, rit = leaf_range.begin(); i != lr_size; rit++, i++) {<--- Prefer prefix ++/-- operators for non-primitive types.
if (0 != merge_tag_val[i]) continue;
moab::CartVect from(&coords[3*i]);
inleaf_merged = false;
// check close-by leaves too
leaves_out.clear();
result = tree.distance_search( from.array(), mergeTol,
leaves_out);
leaf_range2.clear();
for (std::vector<moab::EntityHandle>::iterator vit = leaves_out.begin();
vit != leaves_out.end(); vit++) {<--- Prefer prefix ++/-- operators for non-primitive types.
if (*vit > *it) { // if we haven't visited this leaf yet in the outer loop
result = mbImpl->get_entities_by_handle(*vit, leaf_range2, moab::Interface::UNION);
if (moab::MB_SUCCESS != result) return result;
}
}
if (!leaf_range2.empty()) {
coords.resize(3*(lr_size+leaf_range2.size()));
merge_tag_val.resize(lr_size+leaf_range2.size());
result = mbImpl->get_coords(leaf_range2, &coords[3*lr_size]);
if (moab::MB_SUCCESS != result) return result;
result = mbImpl->tag_get_data(merge_tag, leaf_range2, &merge_tag_val[lr_size]);
if (moab::MB_SUCCESS != result) return result;
outleaf_merged = false;
}
// check other verts in this leaf
for (unsigned int j = i+1; j < merge_tag_val.size(); j++) {
moab::EntityHandle to_ent = j >= lr_size ? leaf_range2[j-lr_size] :
leaf_range[j];
if (*rit == to_ent) continue;
if ((from - moab::CartVect(&coords[3*j])).length_squared() < mergeTolSq) {
merge_tag_val[j] = *rit;
if (j < lr_size){
inleaf_merged = true;}
else{
outleaf_merged = true;}
deadEnts.insert(to_ent);
}
}
if (outleaf_merged) {
result = mbImpl->tag_set_data(merge_tag, leaf_range2, &merge_tag_val[leaf_range.size()]);
if (moab::MB_SUCCESS != result) return result;
outleaf_merged = false;
}
if (inleaf_merged) {
result = mbImpl->tag_set_data(merge_tag, leaf_range, &merge_tag_val[0]);
if (moab::MB_SUCCESS != result) return result;
}
}
}
return moab::MB_SUCCESS;
}
}
|