Approximating Gromov-Hausdorff Distance in Euclidean Space

12/30/2019
by   Sushovan Majhi, et al.
0

The Gromov-Hausdorff distance (d_GH) proves to be a useful distance measure between shapes. In order to approximate d_GH for compact subsets X,Y⊂R^d, we look into its relationship with d_H,iso, the infimum Hausdorff distance under Euclidean isometries. As already known for dimension d≥ 2, the d_H,iso cannot be bounded above by a constant factor times d_GH. For d=1, however, we prove that d_H,iso≤5/4d_GH. We also show that the bound is tight. In effect, this gives rise to an O(nlogn)-time algorithm to approximate d_GH with an approximation factor of (1+1/4).

READ FULL TEXT
research
07/15/2020

Approximating the (continuous) Fréchet distance

We describe the first strongly subquadratic time algorithm with subexpon...
research
07/16/2023

Faster Approximation Schemes for k-TSP and k-MST in the Euclidean Space

In the Euclidean k-TSP (resp. Euclidean k-MST), we are given n points in...
research
08/26/2022

A Subquadratic n^ε-approximation for the Continuous Fréchet Distance

The Fréchet distance is a commonly used similarity measure between curve...
research
11/02/2022

Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique

We study the complexity of computing (and approximating) VC Dimension an...
research
04/05/2020

Maximum parsimony distance on phylogenetictrees: a linear kernel and constant factor approximation algorithm

Maximum parsimony distance is a measure used to quantify the dissimilari...
research
12/04/2019

Compact packings of space with three sizes of spheres

A sphere packing of the three-dimensional Euclidean space is compact if ...
research
02/23/2022

On The Scale Dependence and Spacetime Dimension of the Internet with Causal Sets

A statistical measure of dimension is used to compute the effective aver...

Please sign up or login with your details

Forgot password? Click here to reset