Donald Sheehy

Adaptive Metrics for Adaptive Samples

ALGORITHMS, 13(8).

Efficient Algorithm for the Topological Characterization of Worm-like and Branched Micelle Structures from Simulations

JOURNAL OF CHEMICAL THEORY AND COMPUTATION, 16(7), 4588–4598.

Computing the Shift-Invariant Bottleneck Distance for Persistence Diagrams

CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Winnipeg, Canada.

Fréchet-Stable Signatures Using Persistence Homology

In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1100–1108).

When Can We Treat Trajectories as Points?

CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Winnipeg, Canada.

Supporting Ruled Polygons

CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Ottawa, Ontario.

When and Why the Topological Coverage Criterion Works

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Presented at the Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms.

Adaptive Metrics for Adaptive Samples

CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Vancouver, British Columbia, Canada.

Efficient and robust persistent homology for measures

Computational Geometry, 58, 70–96.

Exploring Circle Packing Algorithms

SOCG: Symposium on Computational Geometry (Multimedia Session). Presented at the 32nd International Symposium on Computational Geometry, Boston, MA.

Interactive Geometric Algorithm Visualization in a Browser

SOCG: Symposium on Computational Geometry (Multimedia Session). Presented at the 32nd International Symposium on Computational Geometry (SoCG 2016), Boston, MA.

Transforming Hierarchical Trees on Metric Spaces

CCCG: The Canadian Conference in Computational Geometry,2016. Presented at the Canadian Conference in Computational Geometry, Vancouver, British Columbia, Canada.

kth Nearest Neighbor Sampling in the Plane

CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Vancouver, British Columbia, Canada.

A Geometric Perspective on Sparse Filtrations

CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Kingston, Ontario.

An Output-Sensitive Algorithm for Computing Weightedα-Complexes

CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Kingston, Ontario.

Approximating Nearest Neighbor Distances

In Lecture Notes in Computer Science (pp. 200–211).

Persistent Homology and Nested Dissection

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Presented at the Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms.

Visualizing Sparse Filtrations

SOCG: Symposium on Computational Geometry (Multimedia Session). Presented at the 31st International Symposium on Computational Geometry, Eindhoven, Netherlands.

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

Discrete & Computational Geometry, 52(3), 476–491.

Efficient and Robust Persistent Homology for Measures

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Presented at the Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms.

The Persistent Homology of Distance Functions under Random Projection

SOCG: Symposium on Computational Geometry. Presented at the 30th International Symposium on Computational Geometry, Kyoto, Japan.

Zigzag Zoology: Rips Zigzags for Homology Inference

Foundations of Computational Mathematics, 15(5), 1151–1186.

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

Proceedings of the 29th annual symposium on Symposuim on computational geometry - SoCG '13. Presented at the the 29th annual symposium.

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

Proceedings of the 29th annual symposium on Symposuim on computational geometry - SoCG '13. Presented at the the 29th annual symposium.

Geometric Separators and the Parabolic Lift

CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Waterloo, Ontario.

Linear-Size Approximations to the Vietoris–Rips Filtration

Discrete & Computational Geometry, 49(4), 778–796.

Zigzag zoology

Proceedings of the 29th annual symposium on Symposuim on computational geometry - SoCG '13. Presented at the the 29th annual symposium.

A Multicover Nerve for Geometric Inference

CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Charlottetown, Prince Edward Island.

Linear-size approximations to the vietoris-rips filtration

Proceedings of the 2012 symposuim on Computational Geometry - SoCG '12. Presented at the the 2012 symposuim.

Minimax Rates for Homology Inference

AISTATS: AI and Statistics. Presented at the 15th International Conference on Artificial Intelligence and Statistics, La Palma, Canary Islands.

New Bounds on the Size of Optimal Meshes

Computer Graphics Forum, 31(5), 1627–1635.

Beating the spread

Proceedings of the 27th annual ACM symposium on Computational geometry - SoCG '11. Presented at the the 27th annual ACM symposium.

Approximate centerpoints with proofs

Computational Geometry, 43(8), 647–654.

Topological inference via meshing

Proceedings of the 2010 annual symposium on Computational geometry - SoCG '10. Presented at the the 2010 annual symposium.

Approximate center points with proofs

Proceedings of the 25th annual symposium on Computational geometry - SCG '09. Presented at the the 25th annual symposium.

Size Complexity of Volume Meshes vs. Surface Meshes

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Presented at the Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms.

The Centervertex Theorem for Wedge Depth

CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Vancouver, British Columbia, Canada.

Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors

CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Montreal, Quebec, Canada.

Linear-size meshes

CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Montreal, Quebec, Canada.

Shape deformation in continuous map generalization

GeoInformatica, 13(2), 203–221.

Size Competitive Meshing Without Large Angles

In Automata, Languages and Programming (pp. 655–666).

Compatible triangulations and point partitions by series-triangular graphs

Computational Geometry, 34(3), 195–202.