Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Håvard Bakke Bjerkevik. Tighter Bounds for Reconstruction from ε-Samples. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 9:1-9:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bakkebjerkevik:LIPIcs.SoCG.2022.9, author = {Bakke Bjerkevik, H\r{a}vard}, title = {{Tighter Bounds for Reconstruction from \epsilon-Samples}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {9:1--9:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.9}, URN = {urn:nbn:de:0030-drops-160170}, doi = {10.4230/LIPIcs.SoCG.2022.9}, annote = {Keywords: Curve reconstruction, surface reconstruction, \epsilon-sampling} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Ulrich Bauer, Håvard Bakke Bjerkevik, and Benedikt Fluhr. Quasi-Universality of Reeb Graph Distances. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 14:1-14:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bauer_et_al:LIPIcs.SoCG.2022.14, author = {Bauer, Ulrich and Bjerkevik, H\r{a}vard Bakke and Fluhr, Benedikt}, title = {{Quasi-Universality of Reeb Graph Distances}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {14:1--14:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.14}, URN = {urn:nbn:de:0030-drops-160221}, doi = {10.4230/LIPIcs.SoCG.2022.14}, annote = {Keywords: Reeb graphs, contour trees, merge trees, distances, universality, interleaving distance, functional distortion distance, functional contortion distance} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Håvard Bakke Bjerkevik and Magnus Bakke Botnan. Computational Complexity of the Interleaving Distance. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 13:1-13:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bjerkevik_et_al:LIPIcs.SoCG.2018.13, author = {Bjerkevik, H\r{a}vard Bakke and Botnan, Magnus Bakke}, title = {{Computational Complexity of the Interleaving Distance}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {13:1--13:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.13}, URN = {urn:nbn:de:0030-drops-87268}, doi = {10.4230/LIPIcs.SoCG.2018.13}, annote = {Keywords: Persistent Homology, Interleavings, NP-hard} }
Feedback for Dagstuhl Publishing