We consider the following geometric pattern matching problem: Given two sets of points in the plane, P and Q, and some δ > 0, find a similarity transformation (translation, rotation and scale) such that h(T(P),Q) < δ, where h(.,.) is the directional Hausdorff distance with L ∞ as the underlying metric. Similarity transformations have not been dealt with in the context of the directional Hausdorff distance and we fill the gap here. We present efficient, exact and approximate algorithms for this problem imposing a reasonable separation restriction on the set Q. For the exact case if the minimum L∞ distance between every pair of points in Q is 8δ then the problem can be solved in O (n2 m log n) time where m and n are the number of points in P and Q respectively. If the points in Q are just cδ apart from each other for any 0 < c < 1 we get a randomized approximate solution with expected runtime O(n 2c-ε-8 log4 mn), where ε > 0 controls the approximation and the answer is correct with high probability.
|Number of pages||4|
|State||Published - 1 Dec 2007|
|Event||19th Annual Canadian Conference on Computational Geometry, CCCG 2007 - Ottawa, ON, Canada|
Duration: 20 Aug 2007 → 22 Aug 2007
|Conference||19th Annual Canadian Conference on Computational Geometry, CCCG 2007|
|Period||20/08/07 → 22/08/07|