diff options
-rw-r--r-- | biblio/bibliography.bib | 28 | ||||
-rw-r--r-- | src/Collapse/include/gudhi/Flag_complex_edge_collapser.h | 6 | ||||
-rw-r--r-- | src/common/doc/main_page.md | 2 |
3 files changed, 20 insertions, 16 deletions
diff --git a/biblio/bibliography.bib b/biblio/bibliography.bib index 4e716986..ad8ce50a 100644 --- a/biblio/bibliography.bib +++ b/biblio/bibliography.bib @@ -1279,15 +1279,21 @@ year = "2011" bibsource = {dblp computer science bibliography, https://dblp.org} } -@unpublished{edgecollapsesocg2020, - title = {{Edge Collapse and Persistence of Flag Complexes}}, - author = {Boissonnat, Jean-Daniel and Pritam, Siddharth}, - url = {https://hal.inria.fr/hal-02395227}, - note = {working paper or preprint}, - year = {2019}, - month = Dec, - keywords = {Persistent homology ; Strong Collapse ; Computational geometry ; Topological Data Analysis ; Computational Topology}, - pdf = {https://hal.inria.fr/hal-02395227/file/socg2020_paper_152.pdf}, - hal_id = {hal-02395227}, - hal_version = {v1}, +@InProceedings{edgecollapsesocg2020, + author = {Jean-Daniel Boissonnat and Siddharth Pritam}, + title = {{Edge Collapse and Persistence of Flag Complexes}}, + booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, + pages = {19:1--19:15}, + series = {Leibniz International Proceedings in Informatics (LIPIcs)}, + ISBN = {978-3-95977-143-6}, + ISSN = {1868-8969}, + year = {2020}, + volume = {164}, + editor = {Sergio Cabello and Danny Z. Chen}, + publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}, + address = {Dagstuhl, Germany}, + URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12177}, + URN = {urn:nbn:de:0030-drops-121777}, + doi = {10.4230/LIPIcs.SoCG.2020.19}, + annote = {Keywords: Computational Topology, Topological Data Analysis, Edge Collapse, Simple Collapse, Persistent homology} } diff --git a/src/Collapse/include/gudhi/Flag_complex_edge_collapser.h b/src/Collapse/include/gudhi/Flag_complex_edge_collapser.h index 01be8f03..d1a47b75 100644 --- a/src/Collapse/include/gudhi/Flag_complex_edge_collapser.h +++ b/src/Collapse/include/gudhi/Flag_complex_edge_collapser.h @@ -342,16 +342,14 @@ class Flag_complex_edge_collapser { /** \brief Implicitly constructs a flag complex from edges as an input, collapses edges while preserving the persistent * homology and returns the remaining edges as a range. * - * \fn auto Gudhi::collapse::flag_complex_collapse_edges(FilteredEdgeRange const& edges) - * * \param[in] edges Range of Filtered edges.There is no need the range to be sorted, as it will be performed. * * \tparam FilteredEdgeRange furnishes `std::begin` and `std::end` methods and returns an iterator on a * FilteredEdge of type `std::tuple<Vertex_handle, Vertex_handle, Filtration_value>` where `Vertex_handle` is the type * of a vertex index and `Filtration_value` is the type of an edge filtration value. * - * \return Remaining edges after collapse of type - * `std::vector<std::tuple<Vertex_handle, Vertex_handle, Filtration_value>>`. + * \return Remaining edges after collapse as a range of + * `<std::tuple<Vertex_handle, Vertex_handle, Filtration_value>`. * * \ingroup edge_collapse * diff --git a/src/common/doc/main_page.md b/src/common/doc/main_page.md index 740a3e52..e19af537 100644 --- a/src/common/doc/main_page.md +++ b/src/common/doc/main_page.md @@ -235,7 +235,7 @@ </td> <td width="15%"> <b>Author:</b> Siddharth Pritam<br> - <b>Introduced in:</b> GUDHI 2.4.0<br> + <b>Introduced in:</b> GUDHI 3.3.0<br> <b>Copyright:</b> MIT<br> <b>Requires:</b> \ref eigen </td> |