Published in: LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)
Oliver A. Chubet, Paul Macnichol, Parth Parikh, Donald R. Sheehy, and Siddharth S. Sheth. Greedy Permutations and Finite Voronoi Diagrams (Media Exposition). In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 64:1-64:5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{chubet_et_al:LIPIcs.SoCG.2023.64, author = {Chubet, Oliver A. and Macnichol, Paul and Parikh, Parth and Sheehy, Donald R. and Sheth, Siddharth S.}, title = {{Greedy Permutations and Finite Voronoi Diagrams}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {64:1--64:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.64}, URN = {urn:nbn:de:0030-drops-179146}, doi = {10.4230/LIPIcs.SoCG.2023.64}, annote = {Keywords: greedy permutation, Voronoi diagrams} }
Published in: LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)
Donald R. Sheehy. The Sum of Squares in Polycubes (Media Exposition). In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 65:1-65:6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{sheehy:LIPIcs.SoCG.2023.65, author = {Sheehy, Donald R.}, title = {{The Sum of Squares in Polycubes}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {65:1--65:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.65}, URN = {urn:nbn:de:0030-drops-179152}, doi = {10.4230/LIPIcs.SoCG.2023.65}, annote = {Keywords: Archimedes, polycubes, sum of squares} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Donald R. Sheehy and Siddharth S. Sheth. Nearly-Doubling Spaces of Persistence Diagrams. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 60:1-60:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{sheehy_et_al:LIPIcs.SoCG.2022.60, author = {Sheehy, Donald R. and Sheth, Siddharth S.}, title = {{Nearly-Doubling Spaces of Persistence Diagrams}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {60:1--60:15}, 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.60}, URN = {urn:nbn:de:0030-drops-160686}, doi = {10.4230/LIPIcs.SoCG.2022.60}, annote = {Keywords: Topological Data Analysis, Persistence Diagrams, Gromov-Hausdorff Distance} }
Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Donald R. Sheehy and Siddharth Sheth. Sketching Persistence Diagrams. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 57:1-57:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{sheehy_et_al:LIPIcs.SoCG.2021.57, author = {Sheehy, Donald R. and Sheth, Siddharth}, title = {{Sketching Persistence Diagrams}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {57:1--57:15}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.57}, URN = {urn:nbn:de:0030-drops-138569}, doi = {10.4230/LIPIcs.SoCG.2021.57}, annote = {Keywords: Bottleneck Distance, Persistent Homology, Approximate Persistence Diagrams} }
Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Donald R. Sheehy. A Sparse Delaunay Filtration. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 58:1-58:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{sheehy:LIPIcs.SoCG.2021.58, author = {Sheehy, Donald R.}, title = {{A Sparse Delaunay Filtration}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {58:1--58: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.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.58}, URN = {urn:nbn:de:0030-drops-138579}, doi = {10.4230/LIPIcs.SoCG.2021.58}, annote = {Keywords: Delaunay Triangulation, Persistent Homology, Sparse Filtrations} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Kirk Gardner, Lynn Asselin, and Donald Sheehy. Interactive Geometric Algorithm Visualization in a Browser. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 64:1-64:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{gardner_et_al:LIPIcs.SoCG.2016.64, author = {Gardner, Kirk and Asselin, Lynn and Sheehy, Donald}, title = {{Interactive Geometric Algorithm Visualization in a Browser}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {64:1--64:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-009-5}, ISSN = {1868-8969}, year = {2016}, volume = {51}, editor = {Fekete, S\'{a}ndor and Lubiw, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.64}, URN = {urn:nbn:de:0030-drops-59563}, doi = {10.4230/LIPIcs.SoCG.2016.64}, annote = {Keywords: Computational Geometry, Processing, JavaScript, Visualisation, Incremental Algorithms} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Kevin Pratt, Connor Riley, and Donald Sheehy. Exploring Circle Packing Algorithms. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 69:1-69:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{pratt_et_al:LIPIcs.SoCG.2016.69, author = {Pratt, Kevin and Riley, Connor and Sheehy, Donald}, title = {{Exploring Circle Packing Algorithms}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {69:1--69:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-009-5}, ISSN = {1868-8969}, year = {2016}, volume = {51}, editor = {Fekete, S\'{a}ndor and Lubiw, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.69}, URN = {urn:nbn:de:0030-drops-59616}, doi = {10.4230/LIPIcs.SoCG.2016.69}, annote = {Keywords: Computational Geometry, Processing, Javascript, Visualization, Incremental Algorithms} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Nicholas J. Cavanna, Mahmoodreza Jahanseir, and Donald R. Sheehy. Visualizing Sparse Filtrations. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 23-25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{cavanna_et_al:LIPIcs.SOCG.2015.23, author = {Cavanna, Nicholas J. and Jahanseir, Mahmoodreza and Sheehy, Donald R.}, title = {{Visualizing Sparse Filtrations}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {23--25}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.23}, URN = {urn:nbn:de:0030-drops-50893}, doi = {10.4230/LIPIcs.SOCG.2015.23}, annote = {Keywords: Topological Data Analysis, Simplicial Complexes, Persistent Homology} }
Feedback for Dagstuhl Publishing