diff options
author | Marc Glisse <marc.glisse@inria.fr> | 2020-01-20 20:26:18 +0100 |
---|---|---|
committer | Marc Glisse <marc.glisse@inria.fr> | 2020-01-20 20:26:18 +0100 |
commit | 8c85fa3f6dcb47346f3070adc46d44c9afca2f2c (patch) | |
tree | 2d46ae73f514cfc367b2d4846bc1299ac399adf8 /src | |
parent | 82b4a1e765adc6ec9d37b1bfb09ce443f642cb08 (diff) |
Reorder skbl and toplexmap so that skbl is next to contractions
Diffstat (limited to 'src')
-rw-r--r-- | src/common/doc/main_page.md | 38 |
1 files changed, 19 insertions, 19 deletions
diff --git a/src/common/doc/main_page.md b/src/common/doc/main_page.md index 90afb05d..23dd3fde 100644 --- a/src/common/doc/main_page.md +++ b/src/common/doc/main_page.md @@ -55,55 +55,55 @@ </tr> </table> -#### Skeleton blocker +#### Toplex Map <table> <tr> <td width="35%" rowspan=2> - \image html "ds_representation.png" + \image html "map.png" </td> <td width="50%"> - The Skeleton-Blocker data-structure proposes a light encoding for simplicial complexes by storing only an *implicit* - representation of its simplices \cite socg_blockers_2011,\cite blockers2012. Intuitively, it just stores the - 1-skeleton of a simplicial complex with a graph and the set of its "missing faces" that is very small in practice. - This data-structure handles all simplicial complexes operations such as simplex enumeration or simplex removal but - operations that are particularly efficient are operations that do not require simplex enumeration such as edge - iteration, link computation or simplex contraction. + The Toplex map data structure is composed firstly of a raw storage of toplices (the maximal simplices) + and secondly of a map which associate any vertex to a set of pointers toward all toplices + containing this vertex. </td> <td width="15%"> - <b>Author:</b> David Salinas<br> - <b>Introduced in:</b> GUDHI 1.1.0<br> + <b>Author:</b> François Godi<br> + <b>Introduced in:</b> GUDHI 2.1.0<br> <b>Copyright:</b> MIT<br> </td> </tr> <tr> <td colspan=2 height="25"> - <b>User manual:</b> \ref skbl + <b>User manual:</b> \ref toplex_map </td> </tr> </table> -#### Toplex Map +#### Skeleton blocker <table> <tr> <td width="35%" rowspan=2> - \image html "map.png" + \image html "ds_representation.png" </td> <td width="50%"> - The Toplex map data structure is composed firstly of a raw storage of toplices (the maximal simplices) - and secondly of a map which associate any vertex to a set of pointers toward all toplices - containing this vertex. + The Skeleton-Blocker data-structure proposes a light encoding for simplicial complexes by storing only an *implicit* + representation of its simplices \cite socg_blockers_2011,\cite blockers2012. Intuitively, it just stores the + 1-skeleton of a simplicial complex with a graph and the set of its "missing faces" that is very small in practice. + This data-structure handles all simplicial complexes operations such as simplex enumeration or simplex removal but + operations that are particularly efficient are operations that do not require simplex enumeration such as edge + iteration, link computation or simplex contraction. </td> <td width="15%"> - <b>Author:</b> François Godi<br> - <b>Introduced in:</b> GUDHI 2.1.0<br> + <b>Author:</b> David Salinas<br> + <b>Introduced in:</b> GUDHI 1.1.0<br> <b>Copyright:</b> MIT<br> </td> </tr> <tr> <td colspan=2 height="25"> - <b>User manual:</b> \ref toplex_map + <b>User manual:</b> \ref skbl </td> </tr> </table> |