Probabilistic Matching of polygons

DMCA

Probabilistic Matching of polygons (2008)

Cached

Save to List
Add to Collection
Correct Errors
Monitor Changes

by Helmut Alt , Ludmila Scharf , Daria Schymura

BibTeX

@MISC{Alt08probabilisticmatching,
    author = {Helmut Alt and Ludmila Scharf and Daria Schymura},
    title = {Probabilistic Matching of polygons },
    year = {2008}
}

OpenURL

Abstract

We analyze a probabilistic algorithm for matching plane compact sets with sufficiently nice boundaries under translations and rigid motions (rotation and translation). Given shapes A and B, the algorithm computes a transformation t such that with high probability the area of overlap of t(A) and B is close to maximal. We give a time bound that does not depend on the number of vertices in the case of polygons.

Keyphrases

probabilistic matching plane compact set nice boundary rigid motion time bound high probability probabilistic algorithm

DMCA