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
|
/* Copyright (c) 1997-2018
Ewgenij Gawrilow, Michael Joswig (Technische Universitaet Berlin, Germany)
http://www.polymake.org
This program 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 2, or (at your option) any
later version: http://www.gnu.org/licenses/gpl.txt.
This program 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.
--------------------------------------------------------------------------------
*/
namespace polymake { namespace topaz {
template <typename Complex>
PowerSet<int> k_skeleton(const Complex& C, const int k)
{
typedef typename Complex::value_type Facet;
PowerSet<int> SK;
for (typename Entire<Complex>::const_iterator f_it=entire(C); !f_it.at_end(); ++f_it) {
// the k skeleton are all faces of dimension <= k.
if (f_it->size()<=k) {
// facets are either equal or none contains the other.
SK+=*f_it;
continue;
}
// the k skeleton a facet are all subsets of size k+1
Subsets_of_k< const Facet& > enumerator(*f_it, k+1);
for (typename Entire< Subsets_of_k< const Facet& > >::iterator s_it=entire(enumerator); !s_it.at_end(); ++s_it) {
// facets are either equal or none contains the other.
SK+=*s_it;
}
}
if (SK.empty()) // the empty complex is represented as a single empty set
SK += Set<int>();
return SK;
}
} }
// Local Variables:
// mode:C++
// c-basic-offset:3
// indent-tabs-mode:nil
// End:
|
