Homology gradient vector field computation: Algorithm 1, new version, but still without computing the transpose of the projection. More...
#include <istream>
#include <ostream>
#include "chomp/system/config.h"
#include "chomp/system/timeused.h"
#include "chomp/system/textfile.h"
#include "chomp/struct/hashsets.h"
#include "chaincon/combchain.h"
#include "chaincon/comblinmap.h"
Go to the source code of this file.
Functions | |
template<class CellT , class CellArray1 , class CellArray2 > | |
void | homologyGVF1 (const CellArray1 &K, CellArray2 &H, tCombLinMap< CellT, CellT > &pi, tCombLinMap< CellT, CellT > &incl, tCombLinMap< CellT, CellT > &phi) |
Computes the homology gradient vector field for the given filtered finite cell complex "K". |
Homology gradient vector field computation: Algorithm 1, new version, but still without computing the transpose of the projection.
Definition in file homgvf1.h.
void homologyGVF1 | ( | const CellArray1 & | K, |
CellArray2 & | H, | ||
tCombLinMap< CellT, CellT > & | pi, | ||
tCombLinMap< CellT, CellT > & | incl, | ||
tCombLinMap< CellT, CellT > & | phi | ||
) |
Computes the homology gradient vector field for the given filtered finite cell complex "K".
Cells that represent homology generators are appended to the vector "H". The projection map "pi", the inclusion from "H" to the complex "K", and the homology gradient vector field "phi" are assumed to be initially zero and are constructed.
Definition at line 59 of file homgvf1.h.
References boundary().
Referenced by homologyGVF().