Computer Science – Computational Geometry
Scientific paper
2009-02-25
Computer Science
Computational Geometry
Scientific paper
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.
Alt Helmut
Scharf Ludmila
Schymura Daria
No associations
LandOfFree
Probabilistic Matching of Planar Regions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Probabilistic Matching of Planar Regions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic Matching of Planar Regions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-157739