Probabilistic Matching of Planar Regions

Simple item page
dc.creatorAlt, Helmut
dc.creatorScharf, Ludmila
dc.creatorSchymura, Daria
dc.date2009-02-25
dc.date.accessioned2026-07-07T12:46:42Z
dc.date.available2026-07-07T12:46:42Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0902.4337
dc.identifierhttp://arxiv.org/abs/0902.4337
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/221474
dc.subjectComputational Geometry
dc.titleProbabilistic Matching of Planar Regions
dc.typetext

Files

Collections

arXiv