default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDon Sheehy
Person information
- affiliation: North Carolina State University, USA
- affiliation (former): University of Connecticut, School of Engineering, Storrs, CT, USA
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Meng He
, Don Sheehy:
Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG). Comput. Geom. 116: 102035 (2024)- 2023
- [c42]Oliver A. Chubet, Parth Parikh, Donald R. Sheehy, Siddharth S. Sheth:
Approximating the Directed Hausdorff Distance. CCCG 2023: 175-189 - [c41]Oliver A. Chubet, Paul Macnichol, Parth Parikh, Donald R. Sheehy, Siddharth S. Sheth:
Greedy Permutations and Finite Voronoi Diagrams (Media Exposition). SoCG 2023: 64:1-64:5 - [c40]Donald R. Sheehy:
The Sum of Squares in Polycubes (Media Exposition). SoCG 2023: 65:1-65:6 - [c39]Oliver A. Chubet, Parth Parikh, Donald R. Sheehy, Siddharth S. Sheth:
Proximity Search in the Greedy Tree. SOSA 2023: 332-342 - 2022
- [j10]Donald R. Sheehy, Siddharth S. Sheth:
Nearly-doubling spaces of persistence diagrams. J. Comput. Geom. 14(2): 65-82 (2022) - [c38]Donald R. Sheehy, Siddharth S. Sheth:
Nearly-Doubling Spaces of Persistence Diagrams. SoCG 2022: 60:1-60:15 - [i17]Oliver A. Chubet, Kirk P. Gardner, Donald R. Sheehy:
A Theory of Sub-Barcodes. CoRR abs/2206.10504 (2022) - 2021
- [c37]Donald R. Sheehy, Siddharth S. Sheth:
Sketching Persistence Diagrams. SoCG 2021: 57:1-57:15 - [c36]Donald R. Sheehy:
A Sparse Delaunay Filtration. SoCG 2021: 58:1-58:16 - [e1]Meng He, Don Sheehy:
Proceedings of the 33rd Canadian Conference on Computational Geometry, CCCG 2021, August 10-12, 2021, Dalhousie University, Halifax, Nova Scotia, Canada. 2021 [contents] - 2020
- [j9]Nicholas J. Cavanna, Donald R. Sheehy:
Adaptive Metrics for Adaptive Samples. Algorithms 13(8): 200 (2020) - [c35]Donald R. Sheehy:
One Hop Greedy Permutations. CCCG 2020: 221-225 - [c34]Kirk P. Gardner, Donald R. Sheehy:
A Simple Algorithm for kNN Sampling in General Metrics. CCCG 2020: 345-351 - [c33]Timothy Chu, Gary L. Miller, Donald R. Sheehy:
Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph. SODA 2020: 411-425 - [i16]Donald R. Sheehy:
A Sparse Delaunay Filtration. CoRR abs/2012.01947 (2020) - [i15]Donald R. Sheehy, Siddharth S. Sheth:
Sketching Persistence Diagrams. CoRR abs/2012.01967 (2020)
2010 – 2019
- 2018
- [c32]Don Sheehy, Oliver Kisielius, Nicholas J. Cavanna:
Computing the Shift-Invariant Bottleneck Distance for Persistence Diagrams. CCCG 2018: 78-84 - [c31]Parasara Sridhar Duggirala, Donald R. Sheehy:
When Can We Treat Trajectories as Points? CCCG 2018: 340-345 - [c30]Donald R. Sheehy:
Fréchet-Stable Signatures Using Persistence Homology. SODA 2018: 1100-1108 - [i14]Nicholas J. Cavanna, Donald R. Sheehy:
The Generalized Persistent Nerve Theorem. CoRR abs/1807.07920 (2018) - [i13]Nicholas J. Cavanna, Donald R. Sheehy:
Adaptive Metrics for Adaptive Samples. CoRR abs/1807.08208 (2018) - [i12]Mahmoodreza Jahanseir, Donald R. Sheehy:
Randomized Incremental Construction of Net-Trees. CoRR abs/1809.01308 (2018) - 2017
- [c29]Nicholas J. Cavanna, Marc Khoury, Donald R. Sheehy:
Supporting Ruled Polygons. CCCG 2017: 191-196 - [c28]Nicholas J. Cavanna, Kirk P. Gardner, Donald R. Sheehy:
When and Why the Topological Coverage Criterion Works. SODA 2017: 2679-2690 - [i11]Nicholas J. Cavanna, Marc Khoury, Donald R. Sheehy:
Supporting Ruled Polygons. CoRR abs/1707.00826 (2017) - [i10]Timothy Chu, Gary L. Miller, Donald R. Sheehy:
Intrinsic Metrics: Nearest Neighbor and Edge Squared Distances. CoRR abs/1709.07797 (2017) - 2016
- [j8]Mickaël Buchet, Frédéric Chazal, Steve Y. Oudot, Donald R. Sheehy:
Efficient and robust persistent homology for measures. Comput. Geom. 58: 70-96 (2016) - [c27]Kirk P. Gardner, Donald R. Sheehy:
kth Nearest Neighbor Sampling in the Plane. CCCG 2016: 34-41 - [c26]Mahmoodreza Jahanseir, Don Sheehy:
Transforming Hierarchical Trees on Metric Spaces. CCCG 2016: 107-113 - [c25]Nicholas J. Cavanna, Donald R. Sheehy:
Adaptive Metrics for Adaptive Samples. CCCG 2016: 128-132 - [c24]Kirk P. Gardner, Lynn Asselin, Donald R. Sheehy:
Interactive Geometric Algorithm Visualization in a Browser. SoCG 2016: 64:1-64:4 - [c23]Kevin Pratt, Connor Riley, Donald R. Sheehy:
Exploring Circle Packing Algorithms. SoCG 2016: 69:1-69:4 - [c22]Michael Kerber, Donald R. Sheehy, Primoz Skraba:
Persistent Homology and Nested Dissection. SODA 2016: 1234-1245 - 2015
- [j7]Steve Y. Oudot, Donald R. Sheehy:
Zigzag Zoology: Rips Zigzags for Homology Inference. Found. Comput. Math. 15(5): 1151-1186 (2015) - [c21]Nicholas J. Cavanna, Mahmoodreza Jahanseir, Don Sheehy:
A Geometric Perspective on Sparse Filtrations. CCCG 2015 - [c20]Donald R. Sheehy:
An Output-Sensitive Algorithm for Computing Weighted α-Complexes. CCCG 2015 - [c19]Nicholas J. Cavanna, Mahmoodreza Jahanseir, Donald R. Sheehy:
Visualizing Sparse Filtrations. SoCG 2015: 23-25 - [c18]Mickaël Buchet, Frédéric Chazal, Steve Y. Oudot, Donald R. Sheehy:
Efficient and Robust Persistent Homology for Measures. SODA 2015: 168-180 - [c17]Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker:
Approximating Nearest Neighbor Distances. WADS 2015: 200-211 - [i9]Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker:
Approximating Nearest Neighbor Distances. CoRR abs/1502.08048 (2015) - [i8]Nicholas J. Cavanna, Mahmoodreza Jahanseir, Donald R. Sheehy:
A Geometric Perspective on Sparse Filtrations. CoRR abs/1506.03797 (2015) - [i7]Peyman Afshani, Donald R. Sheehy, Yannik Stein:
Approximating the Simplicial Depth. CoRR abs/1512.04856 (2015) - 2014
- [j6]Gary L. Miller, Donald R. Sheehy:
A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations. Discret. Comput. Geom. 52(3): 476-491 (2014) - [c16]Donald R. Sheehy:
The Persistent Homology of Distance Functions under Random Projection. SoCG 2014: 328 - 2013
- [j5]Donald R. Sheehy:
Linear-Size Approximations to the Vietoris-Rips Filtration. Discret. Comput. Geom. 49(4): 778-796 (2013) - [c15]Donald R. Sheehy:
Geometric Separators and the Parabolic Lift. CCCG 2013 - [c14]Gary L. Miller, Donald R. Sheehy:
A new approach to output-sensitive voronoi diagrams and delaunay triangulations. SoCG 2013: 281-288 - [c13]Gary L. Miller, Donald R. Sheehy, Ameya Velingker:
A fast algorithm for well-spaced points and approximate delaunay graphs. SoCG 2013: 289-298 - [c12]Steve Y. Oudot, Donald R. Sheehy:
Zigzag zoology: rips zigzags for homology inference. SoCG 2013: 387-396 - [i6]Gary L. Miller, Donald R. Sheehy, Ameya Velingker:
A Fast Algorithm for Well-Spaced Points and Approximate Delaunay Graphs. CoRR abs/1304.0524 (2013) - [i5]Mickaël Buchet, Frédéric Chazal, Steve Y. Oudot, Donald R. Sheehy:
Efficient and Robust Topological Data Analysis on Metric Spaces. CoRR abs/1306.0039 (2013) - 2012
- [j4]Donald R. Sheehy:
New Bounds on the Size of Optimal Meshes. Comput. Graph. Forum 31(5): 1627-1635 (2012) - [c11]Donald R. Sheehy:
A Multicover Nerve for Geometric Inference. CCCG 2012: 309-314 - [c10]Donald R. Sheehy:
Linear-size approximations to the vietoris-rips filtration. SCG 2012: 239-248 - [c9]Sivaraman Balakrishnan, Alessandro Rinaldo, Don Sheehy, Aarti Singh, Larry A. Wasserman:
Minimax rates for homology inference. AISTATS 2012: 64-72 - [i4]Donald R. Sheehy:
Linear-Size Approximations to the Vietoris-Rips Filtration. CoRR abs/1203.6786 (2012) - [i3]Gary L. Miller, Donald R. Sheehy:
A New Approach to Output-Sensitive Voronoi Diagrams. CoRR abs/1212.5098 (2012) - 2011
- [c8]Gary L. Miller, Todd Phillips, Don Sheehy:
Beating the spread: time-optimal point meshing. SCG 2011: 321-330 - [i2]Sivaraman Balakrishnan, Alessandro Rinaldo, Don Sheehy, Aarti Singh, Larry A. Wasserman:
Minimax Rates for Homology Inference. CoRR abs/1112.5627 (2011) - 2010
- [j3]Gary L. Miller, Donald R. Sheehy:
Approximate centerpoints with proofs. Comput. Geom. 43(8): 647-654 (2010) - [c7]Benoît Hudson, Gary L. Miller, Steve Oudot, Donald R. Sheehy:
Topological inference via meshing. SCG 2010: 277-286
2000 – 2009
- 2009
- [j2]Jeff Danciger, Satyan L. Devadoss, John Mugno, Don Sheehy, Rachel A. Ward:
Shape deformation in continuous map generalization. GeoInformatica 13(2): 203-221 (2009) - [c6]Gary L. Miller, Todd Phillips, Donald R. Sheehy:
The Centervertex Theorem for Wedge Depth. CCCG 2009: 79-82 - [c5]Gary L. Miller, Donald R. Sheehy:
Approximate center points with proofs. SCG 2009: 153-158 - [c4]Benoît Hudson, Gary L. Miller, Todd Phillips, Don Sheehy:
Size complexity of volume meshes vs. surface meshes. SODA 2009: 1041-1047 - 2008
- [c3]Jonathan Derryberry, Don Sheehy, Maverick Woo, Danny Dominic Sleator:
Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors. CCCG 2008 - [c2]Don Sheehy, Gary L. Miller, Todd Phillips:
Linear-Size Meshes. CCCG 2008 - 2007
- [c1]Gary L. Miller, Todd Phillips, Donald R. Sheehy:
Size Competitive Meshing Without Large Angles. ICALP 2007: 655-666 - 2006
- [j1]Jeff Danciger, Satyan L. Devadoss, Don Sheehy:
Compatible triangulations and point partitions by series-triangular graphs. Comput. Geom. 34(3): 195-202 (2006) - 2005
- [i1]Jeff Danciger, Satyan L. Devadoss, Don Sheehy:
Compatible Triangulations and Point Partitions by Series-Triangular Graphs. CoRR abs/cs/0502043 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-15 19:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
