---
res:
bibo_abstract:
- For two given simple polygonsP, Q, the problem is to determine a rigid motionI
ofQ giving the best possible match betweenP andQ, i.e. minimizing the Hausdorff
distance betweenP andI(Q). Faster algorithms as the one for the general problem
are obtained for special cases, namely thatI is restricted to translations or
even to translations only in one specified direction. It turns out that determining
pseudo-optimal solutions, i.e. ones that differ from the optimum by just a constant
factor, can be done much more efficiently than determining optimal solutions.
In the most general case, the algorithm for the pseudo-optimal solution is based
on the surprising fact that for the optimal possible match betweenP and an imageI(Q)
ofQ, the distance between the centroids of the edges of the convex hulls ofP andI(Q)
is a constant multiple of the Hausdorff distance betweenP andI(Q). It is also
shown that the Hausdorff distance between two polygons can be determined in timeO(n
logn), wheren is the total number of vertices.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Helmut
foaf_name: Alt, Helmut
foaf_surname: Alt
- foaf_Person:
foaf_givenName: Bernd
foaf_name: Behrends, Bernd
foaf_surname: Behrends
- foaf_Person:
foaf_givenName: Johannes
foaf_name: Blömer, Johannes
foaf_surname: Blömer
foaf_workInfoHomepage: http://www.librecat.org/personId=23
bibo_issue: '3'
bibo_volume: 13
dct_date: 1995^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/1573-7470
dct_language: eng
dct_title: Approximate matching of polygonal shapes@
...