6 citations · 11 across the 10 of their papers we have counts for
17 papers
Sketching Persistence Diagrams
Donald R. Sheehy, Siddharth Sheth
Given a persistence diagram with points, we give an algorithm that produces a sequence of persistence diagrams converging in bottleneck distance to the input diagram, the $…
A Sparse Delaunay Filtration
Donald R. Sheehy
We show how a filtration of Delaunay complexes can be used to approximate the persistence diagram of the distance to a point set in . Whereas the full Delaunay complex can be…
An Efficient Algorithm for Topological Characterisation of Worm-Like and Branched Micelle Structures from Simulations
Breanndan O Conchuir, Kirk Gardner, Kirk E. Jordan +7
Many surfactant-based formulations are utilised in industry as they produce desirable visco-elastic properties at low-concentrations. These properties are due to the presence of wo…
Randomized Incremental Construction of Net-Trees
Mahmoodreza Jahanseir, Donald R. Sheehy
Net-trees are a general purpose data structure for metric data that have been used to solve a wide range of algorithmic problems. We give a simple randomized algorithm to construct…
Adaptive Metrics for Adaptive Samples
Nicholas J. Cavanna, Donald R. Sheehy
In this paper we consider adaptive sampling's local-feature size, used in surface reconstruction and geometric inference, with respect to an arbitrary landmark set rather than the…
The Generalized Persistent Nerve Theorem
Nicholas J. Cavanna, Donald R. Sheehy
In this paper a parameterized generalization of a good cover filtration is introduced called an ε-good cover, defined as a cover filtration in which the reduced homology groups of…