Donald Sheehy

He, M., & Sheehy, D. (2024, January). Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG). COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, Vol. 116. https://doi.org/10.1016/j.comgeo.2023.102035

Cavanna, N. J., & Sheehy, D. R. (2020). Adaptive Metrics for Adaptive Samples. ALGORITHMS, 13(8). https://doi.org/10.3390/a13080200

Conchuir, B. O., Gardner, K., Jordan, K. E., Bray, D. J., Anderson, R. L., Johnston, M. A., … Peters, T. J. (2020). 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. https://doi.org/10.1021/acs.jctc.0c00311

Cavanna, N. J., Kiselius, O., & Sheehy, D. R. (2018). 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.

Sheehy, D. R. (2018). Fréchet-Stable Signatures Using Persistence Homology. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1100–1108). https://doi.org/10.1137/1.9781611975031.71

Duggirala, P. S., & Sheehy, D. R. (2018). When Can We Treat Trajectories as Points? CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Winnipeg, Canada.

Cavanna, N. J., Khoury, M., & Sheehy, D. R. (2017). Supporting Ruled Polygons. CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Ottawa, Ontario.

Cavanna, N. J., Gardner, K. P., & Sheehy, D. R. (2017). 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. https://doi.org/10.1137/1.9781611974782.177

Cavanna, N. J., & Sheehy, D. R. (2016). Adaptive Metrics for Adaptive Samples. CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Vancouver, British Columbia, Canada.

Buchet, M., Chazal, F., Oudot, S. Y., & Sheehy, D. R. (2016). Efficient and robust persistent homology for measures. Computational Geometry, 58, 70–96. https://doi.org/10.1016/j.comgeo.2016.07.001

Pratt, K., Riley, C., & Sheehy, D. R. (2016). Exploring Circle Packing Algorithms. SOCG: Symposium on Computational Geometry (Multimedia Session). Presented at the 32nd International Symposium on Computational Geometry, Boston, MA. https://doi.org/10.4230/LIPIcs.SoCG.2016.69

Asselin, L., Gardner, K., & Sheehy, D. R. (2016). 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.

Jahanseir, M., & Sheehy, D. R. (2016). 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.

Gardner, K., & Sheehy, D. R. (2016). 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.

Cavanna, N. J., Jahanseir, M., & Sheehy, D. R. (2015). A Geometric Perspective on Sparse Filtrations. CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Kingston, Ontario.

Sheehy, D. R. (2015). 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.

Cohen, M. B., Fasy, B. T., Miller, G. L., Nayyeri, A., Sheehy, D. R., & Velingker, A. (2015). Approximating Nearest Neighbor Distances. In Lecture Notes in Computer Science (pp. 200–211). https://doi.org/10.1007/978-3-319-21840-3_17

Kerber, M., Sheehy, D. R., & Skraba, P. (2015). 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. https://doi.org/10.1137/1.9781611974331.ch86

Cavanna, V. S. F. N. J., Jahanseir, M., & Sheehy, D. R. (2015). Visualizing Sparse Filtrations. SOCG: Symposium on Computational Geometry (Multimedia Session). Presented at the 31st International Symposium on Computational Geometry, Eindhoven, Netherlands. https://doi.org/10.4230/LIPIcs.SOCG.2015.23

Miller, G. L., & Sheehy, D. R. (2014). A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations. Discrete & Computational Geometry, 52(3), 476–491. https://doi.org/10.1007/s00454-014-9629-y

Buchet, M., Chazal, F., Oudot, S. Y., & Sheehy, D. R. (2014). 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. https://doi.org/10.1137/1.9781611973730.13

Sheehy, D. R. (2014). 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. https://doi.org/10.1145/2582112.2582126

Oudot, S. Y., & Sheehy, D. R. (2014). Zigzag Zoology: Rips Zigzags for Homology Inference. Foundations of Computational Mathematics, 15(5), 1151–1186. https://doi.org/10.1007/s10208-014-9219-7

Miller, G. L., Sheehy, D. R., & Velingker, A. (2013). 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. https://doi.org/10.1145/2462356.2462404

Miller, G. L., & Sheehy, D. R. (2013). 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. https://doi.org/10.1145/2462356.2462372

Sheehy, D. R. (2013). Geometric Separators and the Parabolic Lift. CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Waterloo, Ontario.

Sheehy, D. R. (2013). Linear-Size Approximations to the Vietoris–Rips Filtration. Discrete & Computational Geometry, 49(4), 778–796. https://doi.org/10.1007/s00454-013-9513-1

Oudot, S. Y., & Sheehy, D. R. (2013). Zigzag zoology. Proceedings of the 29th annual symposium on Symposuim on computational geometry - SoCG '13. Presented at the the 29th annual symposium. https://doi.org/10.1145/2462356.2462371

Sheehy, D. R. (2012). 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.

Sheehy, D. R. (2012). Linear-size approximations to the vietoris-rips filtration. Proceedings of the 2012 symposuim on Computational Geometry - SoCG '12. Presented at the the 2012 symposuim. https://doi.org/10.1145/2261250.2261286

Balakrishnan, S., Rinaldo, A., Singh, A., Sheehy, D. R., & Wasserman, L. (2012). Minimax Rates for Homology Inference. AISTATS: AI and Statistics. Presented at the 15th International Conference on Artificial Intelligence and Statistics, La Palma, Canary Islands.

Sheehy, D. R. (2012). New Bounds on the Size of Optimal Meshes. Computer Graphics Forum, 31(5), 1627–1635. https://doi.org/10.1111/j.1467-8659.2012.03168.x

Miller, G. L., Phillips, T., & Sheehy, D. R. (2011). Beating the spread. Proceedings of the 27th annual ACM symposium on Computational geometry - SoCG '11. Presented at the the 27th annual ACM symposium. https://doi.org/10.1145/1998196.1998252

Miller, G. L., & Sheehy, D. R. (2010). Approximate centerpoints with proofs. Computational Geometry, 43(8), 647–654. https://doi.org/10.1016/j.comgeo.2010.04.006

Hudson, B., Miller, G. L., Oudot, S. Y., & Sheehy, D. R. (2010). Topological inference via meshing. Proceedings of the 2010 annual symposium on Computational geometry - SoCG '10. Presented at the the 2010 annual symposium. https://doi.org/10.1145/1810959.1811006

Miller, G. L., & Sheehy, D. R. (2009). Approximate center points with proofs. Proceedings of the 25th annual symposium on Computational geometry - SCG '09. Presented at the the 25th annual symposium. https://doi.org/10.1145/1542362.1542395

Hudson, B., Miller, G. L., Phillips, T., & Sheehy, D. (2009). 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. https://doi.org/10.1137/1.9781611973068.113

Miller, G. L., Phillips, T., & Sheehy, D. R. (2009). 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.

Derryberry, J., Sleator, D. D., Sheehy, D. R., & Woo, M. (2008). 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.

Miller, G. L., Phillips, T., & Sheehy, D. R. (2008). Linear-size meshes. CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Montreal, Quebec, Canada.

Danciger, J., Devadoss, S. L., Mugno, J., Sheehy, D., & Ward, R. (2008). Shape deformation in continuous map generalization. GeoInformatica, 13(2), 203–221. https://doi.org/10.1007/s10707-008-0049-0

Miller, G. L., Phillips, T., & Sheehy, D. (2007). Size Competitive Meshing Without Large Angles. In Automata, Languages and Programming (pp. 655–666). https://doi.org/10.1007/978-3-540-73420-8_57

Danciger, J., Devadoss, S. L., & Sheehy, D. (2006). Compatible triangulations and point partitions by series-triangular graphs. Computational Geometry, 34(3), 195–202. https://doi.org/10.1016/j.comgeo.2005.11.003