15 citations · 34 across the 26 of their papers we have counts for
7 papers · 1 filter
A constant-factor approximation of the Gromov-Hausdorff distance in the plane
Sushovan Majhi
We give the first polynomial-time constant-factor approximation of the Gromov-Hausdorff distance d_GH between finite point sets in the Euclidean plane; in fixed Euclidean dimension…
Faithful Reeb Graph Reconstruction of a Tectonic Subduction Zone from Earthquake Hypocenters
Halley Fritze, Sushovan Majhi, Marissa Masden +2
An important problem in topological data analysis (TDA)$\unicode{x2014}$of both theoretical and practical interest$\unicode{x2014}$is to reconstruct the topology and geometry of an…
Metric and Path-Connectedness Properties of the Frechet Distance for Paths and Graphs
Erin Chambers, Brittany Fasy, Benjamin Holmgren +2
The Frechet distance is often used to measure distances between paths, with applications in areas ranging from map matching to GPS trajectory analysis to handwriting recognition. M…
Graph Mover's Distance: An Efficiently Computable Distance Measure for Geometric Graphs
Sushovan Majhi
Many applications in pattern recognition represent patterns as a geometric graph. The geometric graph distance (GGD) has recently been studied as a meaningful measure of similarity…
Distance Measures for Geometric Graphs
Sushovan Majhi, Carola Wenk
A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similari…
Topological and Geometric Reconstruction of Metric Graphs in
Brittany Terese Fasy, Rafal Komendarczyk, Sushovan Majhi +1
We propose an algorithm to estimate the topology of an embedded metric graph from a well-sampled finite subset of the underlying graph.
Threshold-Based Graph Reconstruction Using Discrete Morse Theory
Brittany Terese Fasy, Sushovan Majhi, Carola Wenk
Discrete Morse theory has recently been applied in metric graph reconstruction from a given density function concentrated around an (unknown) underlying embedded graph. We propose…