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
|
////////////////////////////////////////////////////////////////////////////////
//
// VertexFacetTable.cc
//
// produced: 16/06/98 jr
//
////////////////////////////////////////////////////////////////////////////////
#include "VertexFacetTable.hh"
namespace topcom {
// additional constructors:
VertexFacetTable::VertexFacetTable(const FastSimplicialComplex& sc) :
vertex_facet_table_data(),
_union_complex(sc) {
#ifdef CONSTRUCTOR_DEBUG
MessageStreams::debug() << message::lock
<< "VertexFacetTable::VertexFacetTable(const FastSimplicialComplex&)"
<< std::endl
<< message::unlock;
#endif
Simplex support(sc.support());
size_type init_size = 0;
for (Simplex::iterator iter = support.begin();
iter != support.end();
++iter) {
init_size = *iter;
}
++init_size;
resize(init_size);
for (size_type i = 0; i < size(); ++i) {
for (FastSimplicialComplex::iterator iter = sc.begin();
iter != sc.end();
++iter)
if (iter->contains(i))
(*this)[i] += *iter;
}
}
// functions:
VertexFacetTable::operator FastSimplicialComplex() const {
FastSimplicialComplex result;
for (size_type i = 0; i < size(); ++i) {
result += (*this)[i];
}
return result;
}
FastSimplicialComplex VertexFacetTable::star(const Simplex& simp) const {
FastSimplicialComplex result(_union_complex);
for (Simplex::iterator iter = simp.begin(); iter != simp.end(); ++iter) {
result *= (*this)[*iter];
}
return result;
}
void VertexFacetTable::remove_star(const Simplex& simp,
SimplicialComplex& from_complex) const {
FastSimplicialComplex star_complex(from_complex);
for (Simplex::iterator iter = simp.begin(); iter != simp.end(); ++iter) {
star_complex *= (*this)[*iter];
}
from_complex -= star_complex;
}
FastSimplicialComplex VertexFacetTable::link(const Simplex& simp) const {
FastSimplicialComplex result(_union_complex);
for (Simplex::iterator iter = simp.begin(); iter != simp.end(); ++iter) {
result *= ((*this)[*iter] - simp);
}
return result;
}
const bool VertexFacetTable::contains_face(const Simplex& simp,
const parameter_type card,
const FastSimplicialComplex& sub) const {
if (card + 1 > sub._maxcard)
return false;
if (sub.contains(simp))
return false;
parameter_type maxmincard = sub._mincard;
parameter_type minmaxcard = sub._maxcard;
if (card + 1 > maxmincard)
maxmincard = card + 1;
for (Simplex::iterator simp_iter = simp.begin();
simp_iter != simp.end();
++simp_iter) {
parameter_type vf_mincard = (*this)[*simp_iter]._mincard;
parameter_type vf_maxcard = (*this)[*simp_iter]._maxcard;
if (vf_mincard > maxmincard)
maxmincard = vf_mincard;
if (vf_maxcard < minmaxcard)
minmaxcard = vf_maxcard;
}
const FastSimplicialComplex::IndexSet** setarray = new const FastSimplicialComplex::IndexSet*[card];
size_type intersection_index = 0;
for (parameter_type i = maxmincard; i < minmaxcard; ++i) {
size_type count = 0;
for (Simplex::iterator simp_iter = simp.begin();
simp_iter != simp.end();
++simp_iter) {
setarray[count++] = &(*this)[*(simp_iter)]._index_set[i];
}
if (sub._index_set[i].intersection_nonempty(setarray, card, intersection_index) != 0) {
delete []setarray;
#ifdef COMPUTATIONS_DEBUG
Simplex test_facet;
if (!sub.contains_face(simp)) {
MessageStreams::forced() << message::lock
<< "internal error: " << simp << " not face in " << *this << '\n'
<< "intersection_index: " << intersection_index << '\n'
<< "maxmincard: " << maxmincard << '\n'
<< "minmaxcard: " << minmaxcard << std::endl;
for (parameter_type j = maxmincard; j < minmaxcard; ++j) {
MessageStreams::forced() << "card = " << j << std::endl;
for (Simplex::iterator simp_iter = simp.begin();
simp_iter != simp.end();
++simp_iter) {
MessageStreams::forced() << "(*this)[" << *simp_iter << "] = "
<< (*this)[*simp_iter]._index_set[j] << std::endl;
}
}
MessageStreams::forced() << message::unlock;
exit(1);
}
#endif
return true;
}
}
delete []setarray;
return false;
}
const bool VertexFacetTable::contains(const Simplex& simp) const {
for (parameter_type i = 0; i < size(); ++i) {
if ((*this)[i].contains(simp)) {
return true;
}
}
return false;
}
const bool VertexFacetTable::contains_free_face(const Simplex& simp,
const parameter_type card,
const FastSimplicialComplex& sub,
Simplex& facet) const {
if (card + 2 > sub._maxcard)
return false;
if (sub.contains(simp))
return false;
parameter_type maxmincard = sub._mincard;
parameter_type minmaxcard = sub._maxcard;
if (card + 1 > maxmincard)
maxmincard = card + 1;
for (Simplex::iterator simp_iter = simp.begin();
simp_iter != simp.end();
++simp_iter) {
parameter_type vf_mincard = (*this)[*simp_iter]._mincard;
parameter_type vf_maxcard = (*this)[*simp_iter]._maxcard;
if (vf_mincard > maxmincard)
maxmincard = vf_mincard;
if (vf_maxcard < minmaxcard)
minmaxcard = vf_maxcard;
}
const FastSimplicialComplex::IndexSet** setarray = new const FastSimplicialComplex::IndexSet*[card];
int intersection_card = 0;
size_type intersection_index = 0;
for (size_type i = maxmincard; i < minmaxcard; ++i) {
size_type count = 0;
for (Simplex::iterator simp_iter = simp.begin();
simp_iter != simp.end();
++simp_iter) {
setarray[count++] = &(*this)[*simp_iter]._index_set[i];
}
int card_of_intersection =
sub._index_set[i].intersection_card(setarray, card, intersection_index);
if (card_of_intersection == 1) {
if (++intersection_card > 1) {
delete []setarray;
#ifdef COMPUTATIONS_DEBUG
if (sub.contains_free_face(simp, facet)) {
MessageStreams::forced() << message::lock
<< "internal error: " << simp << " free in " << *this << std::endl
<< message::unlock;
exit(1);
}
#endif
return false;
}
else {
facet = sub._index_table[i].get_obj(intersection_index);
}
}
else if (card_of_intersection > 1) {
delete []setarray;
#ifdef COMPUTATIONS_DEBUG
if (sub.contains_free_face(simp, facet)) {
MessageStreams::forced() << message::lock
<< "internal error: " << simp << " free in " << *this << std::endl
<< message::unlock;
exit(1);
}
#endif
return false;
}
}
if (intersection_card == 0) {
delete []setarray;
#ifdef COMPUTATIONS_DEBUG
if (sub.contains_free_face(simp, facet)) {
MessageStreams::forced() << message::lock
<< "internal error: " << simp << " free in " << *this << std::endl
<< message::unlock;
exit(1);
}
#endif
return false;
}
#ifdef COMPUTATIONS_DEBUG
Simplex test_facet;
if (!sub.contains_free_face(simp, test_facet)) {
MessageStreams::forced() << message::lock
<< "internal error: " << simp << " not free in " << *this << '\n'
<< "intersection_index: " << intersection_index <<'\n'
<< "intersection_card: " << intersection_card << '\n'
<< "sub.mincard: " << sub.mincard() << '\n'
<< "sub.maxcard: " << sub.maxcard() << std::endl;
for (size_type j = maxmincard; j < minmaxcard; ++j) {
MessageStreams::forced() << "card = " << j << '\n';
for (Simplex::iterator simp_iter = simp.begin();
simp_iter != simp.end();
++simp_iter) {
MessageStreams::forces() << "(*this)[" << *simp_iter << "] = "
<< (*this)[*simp_iter]._index_set[j] << std::endl;
}
}
MessageStreams::forced() << message::unlock;
exit(1);
}
#endif
delete []setarray;
return true;
}
}; // namespace topcom
// eof VertexFacetTable.cc
|
