%0 Journal Article %T Probabilistic Matching of Planar Regions %A Helmut Alt %A Ludmila Scharf %A Daria Schymura %J Computer Science %D 2009 %I arXiv %X We analyze a probabilistic algorithm for matching shapes modeled by planar regions 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. In the case of polygons, we give a time bound that does not depend significantly on the number of vertices. %U http://arxiv.org/abs/0902.4337v1