Probabilistic Matching of Planar Regions

Computer Science – Computational Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-157739

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.