Computing Minimum Area Homologies |
| |
| Authors: | Erin Wolf Chambers Mikael Vejdemo‐Johansson |
| |
| Affiliation: | 1. Department of Math and Computer Science, Saint Louis University, Saint Louis, MO, USA;2. Institute for Mathematics and its Applications, University of Minnesota, Minneapolis, MN, USA;3. Computer Vision and Active Perception Laboratory, KTH Royal Institute of Technology, Stockholm, Sweden;4. AI Laboratory, Jozef Stefan Institute, Ljubljana, Slovenia |
| |
| Abstract: | 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. |
| |
| Keywords: | curves and surfaces computational geometry weird math I.3.5 [Computer Graphics]: Computational Geometry and Object Modelling– Geometric algorithms languages and systems I.5.3 [Pattern Recognition]: Clustering– Similarity measures |
|
|
