41 search results - page 1 / 9 » Approximate input sensitive algorithms for point pattern mat... |
PR
2010
13 years 3 months ago
2010
WADS
2005
Springer
13 years 11 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
COMPGEOM
2001
ACM
13 years 9 months ago
2001
ACM
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
SOFSEM
2007
Springer
13 years 11 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
GBRPR
2005
Springer
13 years 11 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...