Computing minimum area homologies

10/09/2014
by   Erin Wolf Chambers, et al.
0

Calculating and categorizing the similarity of curves is a fundamental problem which has generated much recent interest. However, to date there are no implementations of these algorithms for curves on surfaces with provable guarantees on the quality of the measure. In this paper, we present a similarity measure for any two cycles that are homologous, where we calculate the minimum area of any homology (or connected bounding chain) between the two cycles. The minimum area homology exists for broader classes of cycles than previous measures which are based on homotopy. It is also much easier to compute than previously defined measures, yielding an efficient implementation that is based on linear algebra tools. We demonstrate our algorithm on a range of inputs, showing examples which highlight the feasibility of this similarity measure.

READ FULL TEXT

page 3

page 6

page 7

page 8

research
07/14/2015

Closed Curves and Elementary Visual Object Identification

For two closed curves on a plane (discrete version) and local criteria f...
research
04/08/2020

Comparison of the shape and temporal evolution of even and odd solar cycles

Results. The PCA confirms the existence of the Gnevyshev gap (GG) for so...
research
03/09/2022

On Flipping the Fréchet distance

The classical and extensively-studied Fréchet distance between two curve...
research
06/23/2020

Rigorous verification of Hopf bifurcations via desingularization and continuation

In this paper we present a general approach to rigorously validate Hopf ...
research
12/08/2015

Similarity detection of rational space curves

We provide an algorithm to check whether two rational space curves are r...
research
08/17/2020

When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation

Consider the natural question of how to measure the similarity of curves...

Please sign up or login with your details

Forgot password? Click here to reset