Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Jean-Daniel Boissonnat, Siargey Kachanovich, and Mathijs Wintraecken. Tracing Isomanifolds in ℝ^d in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 17:1-17:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{boissonnat_et_al:LIPIcs.SoCG.2021.17, author = {Boissonnat, Jean-Daniel and Kachanovich, Siargey and Wintraecken, Mathijs}, title = {{Tracing Isomanifolds in \mathbb{R}^d in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {17:1--17:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.17}, URN = {urn:nbn:de:0030-drops-138163}, doi = {10.4230/LIPIcs.SoCG.2021.17}, annote = {Keywords: Coxeter triangulation, Kuhn triangulation, permutahedron, PL-approximations, isomanifolds/solution manifolds/isosurfacing} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Shreya Arya, Jean-Daniel Boissonnat, Kunal Dutta, and Martin Lotz. Dimensionality Reduction for k-Distance Applied to Persistent Homology. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 10:1-10:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{arya_et_al:LIPIcs.SoCG.2020.10, author = {Arya, Shreya and Boissonnat, Jean-Daniel and Dutta, Kunal and Lotz, Martin}, title = {{Dimensionality Reduction for k-Distance Applied to Persistent Homology}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {10:1--10:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.10}, URN = {urn:nbn:de:0030-drops-121682}, doi = {10.4230/LIPIcs.SoCG.2020.10}, annote = {Keywords: Dimensionality reduction, Johnson-Lindenstrauss lemma, Topological Data Analysis, Persistent Homology, k-distance, distance to measure} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Jean-Daniel Boissonnat and Siddharth Pritam. Edge Collapse and Persistence of Flag Complexes. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 19:1-19:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{boissonnat_et_al:LIPIcs.SoCG.2020.19, author = {Boissonnat, Jean-Daniel and Pritam, Siddharth}, 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 = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.19}, 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} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Jean-Daniel Boissonnat and Mathijs Wintraecken. The Topological Correctness of PL-Approximations of Isomanifolds. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 20:1-20:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{boissonnat_et_al:LIPIcs.SoCG.2020.20, author = {Boissonnat, Jean-Daniel and Wintraecken, Mathijs}, title = {{The Topological Correctness of PL-Approximations of Isomanifolds}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {20:1--20:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.20}, URN = {urn:nbn:de:0030-drops-121787}, doi = {10.4230/LIPIcs.SoCG.2020.20}, annote = {Keywords: PL-approximations, isomanifolds, solution manifolds, topological correctness} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Jean-Daniel Boissonnat, Olivier Devillers, Kunal Dutta, and Marc Glisse. Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 22:1-22:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{boissonnat_et_al:LIPIcs.ESA.2019.22, author = {Boissonnat, Jean-Daniel and Devillers, Olivier and Dutta, Kunal and Glisse, Marc}, title = {{Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {22:1--22:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.22}, URN = {urn:nbn:de:0030-drops-111437}, doi = {10.4230/LIPIcs.ESA.2019.22}, annote = {Keywords: Randomized incremental construction, Delaunay triangulations, Voronoi diagrams, polyhedral surfaces, probabilistic analysis} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Jean-Daniel Boissonnat and Siddharth Pritam. Computing Persistent Homology of Flag Complexes via Strong Collapses. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 55:1-55:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{boissonnat_et_al:LIPIcs.SoCG.2019.55, author = {Boissonnat, Jean-Daniel and Pritam, Siddharth}, title = {{Computing Persistent Homology of Flag Complexes via Strong Collapses}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {55:1--55:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.55}, URN = {urn:nbn:de:0030-drops-104596}, doi = {10.4230/LIPIcs.SoCG.2019.55}, annote = {Keywords: Computational Topology, Topological Data Analysis, Strong Collapse, Persistent homology} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Jean-Daniel Boissonnat, Siddharth Pritam, and Divyansh Pareek. Strong Collapse for Persistence. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 67:1-67:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{boissonnat_et_al:LIPIcs.ESA.2018.67, author = {Boissonnat, Jean-Daniel and Pritam, Siddharth and Pareek, Divyansh}, title = {{Strong Collapse for Persistence}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {67:1--67:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.67}, URN = {urn:nbn:de:0030-drops-95302}, doi = {10.4230/LIPIcs.ESA.2018.67}, annote = {Keywords: Computational Topology, Topological Data Analysis, Strong Collapse, Persistent homology} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken. Local Criteria for Triangulation of Manifolds. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 9:1-9:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{boissonnat_et_al:LIPIcs.SoCG.2018.9, author = {Boissonnat, Jean-Daniel and Dyer, Ramsay and Ghosh, Arijit and Wintraecken, Mathijs}, title = {{Local Criteria for Triangulation of Manifolds}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {9:1--9:14}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.9}, URN = {urn:nbn:de:0030-drops-87224}, doi = {10.4230/LIPIcs.SoCG.2018.9}, annote = {Keywords: manifold, simplicial complex, homeomorphism, triangulation} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Jean-Daniel Boissonnat, André Lieutier, and Mathijs Wintraecken. The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{boissonnat_et_al:LIPIcs.SoCG.2018.10, author = {Boissonnat, Jean-Daniel and Lieutier, Andr\'{e} and Wintraecken, Mathijs}, title = {{The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {10:1--10:14}, 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.10}, URN = {urn:nbn:de:0030-drops-87236}, doi = {10.4230/LIPIcs.SoCG.2018.10}, annote = {Keywords: Reach, Metric distortion, Manifolds, Convexity} }
Published in: LIPIcs, Volume 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, and Sudeshna Kolay. Kernelization of the Subset General Position Problem in Geometry. In 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 83, pp. 25:1-25:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{boissonnat_et_al:LIPIcs.MFCS.2017.25, author = {Boissonnat, Jean-Daniel and Dutta, Kunal and Ghosh, Arijit and Kolay, Sudeshna}, title = {{Kernelization of the Subset General Position Problem in Geometry}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {25:1--25:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-046-0}, ISSN = {1868-8969}, year = {2017}, volume = {83}, editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.25}, URN = {urn:nbn:de:0030-drops-80863}, doi = {10.4230/LIPIcs.MFCS.2017.25}, annote = {Keywords: Incidence Geometry, Kernel Lower bounds, Hyperplanes, Bounded degree polynomials} }
Published in: LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017)
Jean-Daniel Boissonnat, Mael Rouxel-Labbé, and Mathijs Wintraecken. Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 19:1-19:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{boissonnat_et_al:LIPIcs.SoCG.2017.19, author = {Boissonnat, Jean-Daniel and Rouxel-Labb\'{e}, Mael and Wintraecken, Mathijs}, title = {{Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {19:1--19:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-038-5}, ISSN = {1868-8969}, year = {2017}, volume = {77}, editor = {Aronov, Boris and Katz, Matthew J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.19}, URN = {urn:nbn:de:0030-drops-72060}, doi = {10.4230/LIPIcs.SoCG.2017.19}, annote = {Keywords: Riemannian Geometry, Voronoi diagram, Delaunay triangulation} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Jean-Daniel Boissonnat, Karthik C. S., and Sébastien Tavenas. Building Efficient and Compact Data Structures for Simplicial Complexes. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 642-657, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{boissonnat_et_al:LIPIcs.SOCG.2015.642, author = {Boissonnat, Jean-Daniel and S., Karthik C. and Tavenas, S\'{e}bastien}, title = {{Building Efficient and Compact Data Structures for Simplicial Complexes}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {642--657}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.642}, URN = {urn:nbn:de:0030-drops-50981}, doi = {10.4230/LIPIcs.SOCG.2015.642}, annote = {Keywords: Simplicial complex, Compact data structures, Automaton, NP-hard} }
Feedback for Dagstuhl Publishing