Don Sheehy

Comput. Geom., January, 2024

2023

Proximity Search in the Greedy Tree.

[BibT_eX]

[DOI]

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

The Sum of Squares in Polycubes (Media Exposition).

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

Greedy Permutations and Finite Voronoi Diagrams (Media Exposition).

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

A Theory of Sub-Barcodes.

[BibT_eX]

[DOI]

Oliver A. Chubet

CoRR, 2022

Nearly-Doubling Spaces of Persistence Diagrams.

[BibT_eX]

[DOI]

Siddharth Sheth

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Sketching Persistence Diagrams.

[BibT_eX]

[DOI]

Siddharth Sheth

Proceedings of the 37th International Symposium on Computational Geometry, 2021

A Sparse Delaunay Filtration.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Adaptive Metrics for Adaptive Samples.

[BibT_eX]

[DOI]

Algorithms, 2020

Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph.

[BibT_eX]

[DOI]

Timothy Chu

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

One Hop Greedy Permutations.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

A Simple Algorithm for kNN Sampling in General Metrics.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2018

Randomized Incremental Construction of Net-Trees.

[BibT_eX]

[DOI]

CoRR, 2018

The Generalized Persistent Nerve Theorem.

[BibT_eX]

[DOI]

CoRR, 2018

Fréchet-Stable Signatures Using Persistence Homology.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Computing the Shift-Invariant Bottleneck Distance for Persistence Diagrams.

[BibT_eX]

[DOI]

Oliver Kisielius

Parasara Sridhar Duggirala

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

When Can We Treat Trajectories as Points?

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Intrinsic Metrics: Nearest Neighbor and Edge Squared Distances.

[BibT_eX]

[DOI]

Timothy Chu

CoRR, 2017

When and Why the Topological Coverage Criterion Works.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Supporting Ruled Polygons.

[BibT_eX]

Marc Khoury

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

Efficient and robust persistent homology for measures.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Persistent Homology and Nested Dissection.

[BibT_eX]

[DOI]

Michael Kerber

Primoz Skraba

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Exploring Circle Packing Algorithms.

[BibT_eX]

[DOI]

Kevin Pratt

Connor Riley

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Interactive Geometric Algorithm Visualization in a Browser.

[BibT_eX]

[DOI]

Lynn Asselin

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Transforming Hierarchical Trees on Metric Spaces.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

kth Nearest Neighbor Sampling in the Plane.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Zigzag Zoology: Rips Zigzags for Homology Inference.

[BibT_eX]

[DOI]

Steve Y. Oudot

Found. Comput. Math., 2015

Approximating the Simplicial Depth.

[BibT_eX]

[DOI]

Peyman Afshani

Yannik Stein

CoRR, 2015

Approximating Nearest Neighbor Distances.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Visualizing Sparse Filtrations.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

An Output-Sensitive Algorithm for Computing Weighted α-Complexes.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

A Geometric Perspective on Sparse Filtrations.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

The Persistent Homology of Distance Functions under Random Projection.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

Linear-Size Approximations to the Vietoris-Rips Filtration.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Efficient and Robust Topological Data Analysis on Metric Spaces.

[BibT_eX]

[DOI]

CoRR, 2013

A fast algorithm for well-spaced points and approximate delaunay graphs.

[BibT_eX]

[DOI]

Ameya Velingker

Proceedings of the Symposium on Computational Geometry 2013, 2013

A new approach to output-sensitive voronoi diagrams and delaunay triangulations.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

Geometric Separators and the Parabolic Lift.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Minimax rates for homology inference.

[BibT_eX]

[DOI]

Sivaraman Balakrishnan

Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012

A New Approach to Output-Sensitive Voronoi Diagrams

[BibT_eX]

[DOI]

CoRR, 2012

New Bounds on the Size of Optimal Meshes.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2012

A Multicover Nerve for Geometric Inference.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Beating the spread: time-optimal point meshing.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

Approximate centerpoints with proofs.

[BibT_eX]

[DOI]

Comput. Geom., 2010

Topological inference via meshing.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Shape deformation in continuous map generalization.

[BibT_eX]

[DOI]

GeoInformatica, 2009

Size complexity of volume meshes vs. surface meshes.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Approximate center points with proofs.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

The Centervertex Theorem for Wedge Depth.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Linear-Size Meshes.

[BibT_eX]

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors.

[BibT_eX]

Jonathan Derryberry

Maverick Woo

Danny Dominic Sleator

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

Size Competitive Meshing Without Large Angles.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Compatible triangulations and point partitions by series-triangular graphs.

[BibT_eX]

[DOI]

Jeff Danciger

Satyan L. Devadoss