]>
git.sthu.org Git - libstick.git/blob - libstick-0.1/simplicialcomplex.h
1 #ifndef simplicialcomplex_h_nealaezeojeeChuh
2 #define simplicialcomplex_h_nealaezeojeeChuh
13 #include <libstick-0.1/booleanmatrix.h>
18 /** A simplicial complex is a std::vector of simplices such that each face is
19 * also part of the complex. Every simplex has dimension at most MAXDIM. The
20 * indices of simplices resp. their faces are of type IT. To each simplex a
21 * value is assigend, which is of type VT. When a simplicial_complex is
22 * instantiated, a single (-1) dimensional simplex is automatically created.
23 * Each 0-dimensional simplex automatically has this simplex as its face.
24 * Consequently, the innner class simplex_order gives the extended boundary
26 template<int MAXDIM
, class IT
=uint32_t, class VT
=double>
27 class simplicial_complex
{
30 /** The type of this class. */
31 typedef simplicial_complex
<MAXDIM
, IT
, VT
> simplcompltype
;
32 /** Type of indices of simplices. */
33 typedef IT index_type
;
34 /** To every simplex a function value is assigned according to which a
35 * filtration is considered. This is the value type of the function. */
36 typedef VT value_type
;
38 /** A simplex of the complex. */
40 /** Dimension of the simplex. */
42 /** The indices of the faces of the simplex. */
43 index_type faces
[MAXDIM
+1];
44 /** The value of the simplex. */
47 /** Create a new simplex with dimension 'dim', (dim+1)-faces and
48 * its value. If simpley is 0-dimensional, its face is
49 * automatically set to one (-1)-dimensional simplex. */
50 static Simplex
create(int dim
, index_type
* faces
, value_type value
) {
51 assert(0 <= dim
&& dim
<= MAXDIM
);
58 memcpy(s
.faces
, faces
, face_count_bydim(dim
)*sizeof(index_type
));
65 /** Create a (-1)-dimensional simplex. It has the lowest possible value. */
66 static Simplex
create_minusonedim_simplex() {
71 s
.value
= std::numeric_limits
<VT
>::has_infinity
72 ? -std::numeric_limits
<VT
>::infinity()
73 : std::numeric_limits
<VT
>::min();
78 /** Get number of faces. */
79 size_t face_count() const {
80 return face_count_bydim(dim
);
83 /** Get number of faces of a dim-dimensional simplex. */
84 static size_t face_count_bydim(int dim
) {
85 assert(-1 <= dim
&& dim
<= MAXDIM
);
90 /** An order of the simplices of complex c. An order can be interpreted
91 * as a permuation of the complex's std::vector of simplices. */
95 typedef boolean_colrowmatrix
<IT
> boundary_matrix
;
97 /** Create a standard order of the complex c, i.e., the identity permutation. */
98 simplex_order(const simplcompltype
&c
) :
104 /** Reset order to the identity permutation of the complex's simplices. */
107 for (unsigned i
=0; i
< c
.size(); ++i
)
112 /** Return number of simplices. */
113 size_t size() const {
114 assert(order
.size() == revorder
.size());
118 /** Get i-th simplex in the simplex order. */
119 const Simplex
& get_simplex(size_t i
) const {
121 return c
.simplices
[order
.at(i
)];
124 /** Returns true iff the faces of simplex i are before i in this order. */
125 bool is_filtration() const {
126 assert(size() == c
.size());
128 for (unsigned i
=0; i
< size(); ++i
)
129 for (unsigned f
=0; f
< get_simplex(i
).face_count(); ++f
)
130 if (revorder
[get_simplex(i
).faces
[f
]] >= i
)
136 /** Returns true iff is_filtration() gives true and values of simplices
137 * are monotone w.r.t. this order of simplices. */
138 bool is_monotone() const {
139 assert(size() == c
.size());
141 for (unsigned i
=1; i
< size(); ++i
)
142 if (get_simplex(i
-1).value
> get_simplex(i
).value
)
145 return is_filtration();
148 /** Sort simplices such that is_monotone() gives true. This
149 * requires that the complex's is_monotone() gave true
151 void make_monotone_filtration() {
152 assert(c
.is_monotone());
154 sort(order
.begin(), order
.end(), cmp_monotone_filtration(c
));
155 restore_revorder_from_order();
157 assert(c
.is_monotone());
158 assert(is_filtration());
159 assert(is_monotone());
162 /** Get the boundary matrix of the complex according to this order. */
163 boundary_matrix
get_boundary_matrix() const {
164 boundary_matrix
mat(size());
166 for (unsigned c
=0; c
< size(); ++c
)
167 for(unsigned r
=0; r
< get_simplex(c
).face_count(); ++r
)
168 mat
.set(revorder
[get_simplex(c
).faces
[r
]], c
, true);
174 /** Reconstruct 'revorder' by inverting the permutation given by 'order'. */
175 void restore_revorder_from_order() {
176 // Make revorder * order the identity permutation
177 for (unsigned i
=0; i
< size(); ++i
)
178 revorder
[order
[i
]] = i
;
181 /** The complex of which we consider a simplex order. */
182 const simplcompltype
&c
;
184 /** The i-th simplex in order is the order[i]-th simplex of the
185 * complex. 'order' can be seen as a permutation of the
186 * simplices saved in 'c'. */
187 std::vector
<index_type
> order
;
189 /** The i-th simplex in the complex is the revorder[i]-th
190 * simplex in order. 'revorder' can be seen as the inverse
191 * permutation saved in 'order'. */
192 std::vector
<index_type
> revorder
;
196 simplicial_complex() {
197 // Add the one minus-one dimensional simplex
198 add_simplex(Simplex::create_minusonedim_simplex());
201 /** Return number of simplices. */
202 size_t size() const {
203 return simplices
.size();
206 /** Add a simplex to the complex. The dimension of the faces must be
207 * dim-1, and they must already be part of the complex. */
208 void add_simplex(int dim
, index_type
* faces
, value_type value
) {
209 add_simplex(Simplex::create(dim
, faces
, value
));
212 /** Add a simplex to the complex. The dimension of the faces must be
213 * dim-1, and they must already be part of the complex. */
214 void add_simplex(Simplex s
) {
215 // Check requirements for faces
216 for (unsigned i
=0; i
< s
.face_count(); ++i
) {
217 // Faces are already in complex.
218 assert(s
.faces
[i
] < size());
219 // Faces have dimension dim-1
220 assert(simplices
[s
.faces
[i
]].dim
== s
.dim
-1);
223 simplices
.push_back(s
);
226 /** Add an array of simplices */
227 void add_simplices(Simplex
* sarray
, size_t count
) {
228 for (unsigned i
=0; i
< count
; ++i
)
229 add_simplex(sarray
[i
]);
232 /** Return true iff for each simplex i with dimension dim it holds that
233 * the faces of i are contained in the complex and have dimension dim-1. */
234 bool is_complex() const {
235 for (unsigned i
=0; i
< size(); ++i
) {
237 const Simplex
&s
= simplices
[i
];
238 for (unsigned f
=0; f
< s
.face_count(); ++f
) {
240 if (s
.faces
[f
] >= size())
243 const Simplex
&face
= simplices
[s
.faces
[f
]];
244 if (face
.dim
!= s
.dim
-1)
251 /** Returns true iff simplex's values are monotone w.r.t.
252 * face-inclusion, i.e., for each simplex its value is not smaller than
253 * the values of its faces. Requires that is_complex() gives true. */
254 bool is_monotone() const {
255 assert(is_complex());
257 typename
std::vector
<Simplex
>::const_iterator it
= ++simplices
.begin();
258 for (; it
!= simplices
.end(); ++it
)
259 for (unsigned f
=0; f
< it
->face_count(); ++f
)
260 if (simplices
[it
->faces
[f
]].value
> it
->value
)
267 /** Compares (operator<) two simplices (i.e. indices) in a
268 * simplex_order w.r.t. lexicographical order on (value,
269 * dimension)-tuples. */
270 struct cmp_monotone_filtration
{
271 const simplicial_complex
&c
;
273 cmp_monotone_filtration(const simplicial_complex
&c
) :
277 bool operator()(index_type i
, index_type j
) {
278 const Simplex
& si
= c
.simplices
[i
];
279 const Simplex
& sj
= c
.simplices
[j
];
281 if (si
.value
< sj
.value
)
283 else if (si
.value
== sj
.value
)
284 return si
.dim
< sj
.dim
;
291 /** A list of simplices */
292 std::vector
<Simplex
> simplices
;