Approximate matching of polygonal shapes
Alt, Helmut
Behrends, Bernd
Blömer, Johannes
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.
1995
info:eu-repo/semantics/article
doc-type:article
text
https://ris.uni-paderborn.de/record/3037
Alt H, Behrends B, Blömer J. Approximate matching of polygonal shapes. <i>Annals of Mathematics and Artificial Intelligence</i>. 1995;13(3).
eng
info:eu-repo/semantics/altIdentifier/issn/1573-7470
info:eu-repo/semantics/closedAccess