Don Sheehy

Orcid: 0000-0002-9177-2713

Affiliations:
  • North Carolina State University, USA
  • University of Connecticut, School of Engineering, Storrs, CT, USA (former)


According to our database1, Don Sheehy authored at least 55 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG).
Comput. Geom., January, 2024

2023
Proximity Search in the Greedy Tree.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

The Sum of Squares in Polycubes (Media Exposition).
Proceedings of the 39th International Symposium on Computational Geometry, 2023

Greedy Permutations and Finite Voronoi Diagrams (Media Exposition).
Proceedings of the 39th International Symposium on Computational Geometry, 2023

Approximating the Directed Hausdorff Distance.
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022
A Theory of Sub-Barcodes.
CoRR, 2022

Nearly-Doubling Spaces of Persistence Diagrams.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
Sketching Persistence Diagrams.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

A Sparse Delaunay Filtration.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Adaptive Metrics for Adaptive Samples.
Algorithms, 2020

Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

One Hop Greedy Permutations.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

A Simple Algorithm for kNN Sampling in General Metrics.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2018
Randomized Incremental Construction of Net-Trees.
CoRR, 2018

The Generalized Persistent Nerve Theorem.
CoRR, 2018

Fréchet-Stable Signatures Using Persistence Homology.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Computing the Shift-Invariant Bottleneck Distance for Persistence Diagrams.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

When Can We Treat Trajectories as Points?
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Intrinsic Metrics: Nearest Neighbor and Edge Squared Distances.
CoRR, 2017

When and Why the Topological Coverage Criterion Works.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Supporting Ruled Polygons.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Efficient and robust persistent homology for measures.
Comput. Geom., 2016

Persistent Homology and Nested Dissection.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Exploring Circle Packing Algorithms.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Interactive Geometric Algorithm Visualization in a Browser.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Transforming Hierarchical Trees on Metric Spaces.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

kth Nearest Neighbor Sampling in the Plane.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Zigzag Zoology: Rips Zigzags for Homology Inference.
Found. Comput. Math., 2015

Approximating the Simplicial Depth.
CoRR, 2015

Approximating Nearest Neighbor Distances.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Visualizing Sparse Filtrations.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

An Output-Sensitive Algorithm for Computing Weighted α-Complexes.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

A Geometric Perspective on Sparse Filtrations.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations.
Discret. Comput. Geom., 2014

The Persistent Homology of Distance Functions under Random Projection.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Linear-Size Approximations to the Vietoris-Rips Filtration.
Discret. Comput. Geom., 2013

Efficient and Robust Topological Data Analysis on Metric Spaces.
CoRR, 2013

A fast algorithm for well-spaced points and approximate delaunay graphs.
Proceedings of the Symposium on Computational Geometry 2013, 2013

A new approach to output-sensitive voronoi diagrams and delaunay triangulations.
Proceedings of the Symposium on Computational Geometry 2013, 2013

Geometric Separators and the Parabolic Lift.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Minimax rates for homology inference.
Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012

A New Approach to Output-Sensitive Voronoi Diagrams
CoRR, 2012

New Bounds on the Size of Optimal Meshes.
Comput. Graph. Forum, 2012

A Multicover Nerve for Geometric Inference.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Beating the spread: time-optimal point meshing.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010
Approximate centerpoints with proofs.
Comput. Geom., 2010

Topological inference via meshing.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
Shape deformation in continuous map generalization.
GeoInformatica, 2009

Size complexity of volume meshes vs. surface meshes.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Approximate center points with proofs.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

The Centervertex Theorem for Wedge Depth.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Linear-Size Meshes.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Size Competitive Meshing Without Large Angles.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006
Compatible triangulations and point partitions by series-triangular graphs.
Comput. Geom., 2006


  Loading...