Repository navigation
Homological Discrete Vector Fields - #9004
umenohana13 wants to merge 348 commits into
Conversation
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
|
@umenohana13 I started fixing errors showing up in the CI, but there are too many to make. It is now headers compiled in isolation which do not |
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
|
|
||
| This boundary is a finite linear combination of cells of dimension `q`+1. It is encoded as a row-major chain (which maps each cell with a non-zero coefficient to this coefficient). This co-boundary is thus the `id_cell`-th row of the boundary matrix in dimension `q`+1. | ||
| */ | ||
| Row_chain cod(size_t id_cell, int q); |
There was a problem hiding this comment.
It goes with d : usually we use d for the boundary operator, and d^* for the co-boundary, I wrote cod for co-d.
In our (finite dimension) context, it's just the operator which matrix is the transpose of d (but in a more general context, the definition is more complex.
Is it unclear?
|
|
||
| The concept `Filtration` describes the requirements for persistent filtrations associated to persistent homology computation. | ||
|
|
||
| A filtration is associated to an `AbstractSimplicialComplex`. Each cells is equiped with a scalar value (called its degree) and the filtration is an enumeration of cells in any dimension by increasing degrees. |
There was a problem hiding this comment.
AbstractSimplicialComplex has no link.
There was a problem hiding this comment.
Oups, it's "AbstractChainComplex".
DONE
| /*! | ||
| * \brief Gets HDVF option. | ||
| */ | ||
| int hdvf_opts (); |
| * | ||
| * The function returns `true` if the reduced boundary matrix is null and `false` otherwise. | ||
| */ | ||
| bool is_perfect_hdvf(); |
| /// @{ | ||
|
|
||
| /*! | ||
| * \brief A operation: pairs two critical cells. |
There was a problem hiding this comment.
I think you should systematically write A-operation to avoid confusion with the word "A".
There was a problem hiding this comment.
In fact at some places you write A() operation which is also ok.
| * \param verbose If `true`, all intermediate reductions are printed out. | ||
| * | ||
| */ | ||
| std::vector<Pair_cells> compute_perfect_hdvf(bool verbose = false); |
There was a problem hiding this comment.
Maybe replace Pair_cells with Cell_pair
| virtual std::vector<std::vector<int> > psc_labels () const; | ||
|
|
||
| /*! | ||
| * \brief Returns a chain containing the homology generator associated to `cell` (critical cell) of dimension `q` (in particular for vtk export). |
There was a problem hiding this comment.
| * \brief Returns a chain containing the homology generator associated to `cell` (critical cell) of dimension `q` (in particular for vtk export). | |
| * \brief Returns a chain containing the homology generator associated to `cell` (critical cell) of dimension `q`. |
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
This comment was marked as outdated.
-> Full_lu -> Hdvf -> Couldn't understand how to call generic functions (for Zp and int)?
…th the local member function
-> Sparse matrices now receive the sparse chain type as a tparam -> Updated all classes accordingly -> All tests are OK -> Concepts updated (need checks especially for AbstractSimplicialChainComplex - how to describe the Sparse_matrix structure passed as argument...)
-> review all the code / examples / tests to comply with new structure @todo: check the documentation (related modifications are commented with warnings)
|
/force-build:v0 |
|
The documentation is built. It will be available, after a few minutes, here: https://cgal.github.io/9004/v0/Manual/index.html |
| Number_types | ||
| Circulator | ||
| Stream_support | ||
| Surface_mesh |
There was a problem hiding this comment.
| Surface_mesh | |
| Surface_mesh | |
| Triangulation_3 | |
| * | ||
| * \brief Comparison of two COLUMN matrices. | ||
| */ | ||
| template <typename _CT, template <typename, int> typename SCT> |
There was a problem hiding this comment.
You have to write what SCT means
|
|
||
| /** \relates Sparse_matrix_core | ||
| * | ||
| * \brief Comparison of a COLUMN and a ROW matrix. |
There was a problem hiding this comment.
| * \brief Comparison of a COLUMN and a ROW matrix. | |
| * \brief Comparison of a `COLUMN` and a `ROW` matrix. |
Started to correct all points mentionned
-> modifications according to G. Damiand's review
|
@albert-github confirmed that the backtick issue in |
|
/force-build:v0 |
|
There was an error while building the doc: |
Summary of Changes
The pull request contains the first version of:
Release Management
HDVF/Surface_mesh_topology