Probabilistic Matching of Planar Regions
Computational Geometry
2009-02-26 v1
Abstract
We analyze a probabilistic algorithm for matching shapes modeled by planar regions under translations and rigid motions (rotation and translation). Given shapes and , the algorithm computes a transformation such that with high probability the area of overlap of and is close to maximal. In the case of polygons, we give a time bound that does not depend significantly on the number of vertices.
Cite
@article{arxiv.0902.4337,
title = {Probabilistic Matching of Planar Regions},
author = {Helmut Alt and Ludmila Scharf and Daria Schymura},
journal= {arXiv preprint arXiv:0902.4337},
year = {2009}
}