Introduces the kinetic hourglass as a novel kinetic data structure for maintaining bottleneck distances under continuous motion, with application to persistent homology transforms of shapes.
Geometry helps to compare persistence diagrams
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Kinetic Hourglass Data Structure for Computing the Bottleneck Distance of Dynamic Data
Introduces the kinetic hourglass as a novel kinetic data structure for maintaining bottleneck distances under continuous motion, with application to persistent homology transforms of shapes.