TY - GEN
T1 - Matching algorithms for finite point sets in plane
AU - Rao, Nageswara S.V.
AU - Wu, Wencheng
AU - Glover, Charles W.
PY - 1991
Y1 - 1991
N2 - Given two sets P and Q of n and m (≤n) labeled points, respectively, in plane, the matching problem considered here is to determine all occurrences of Q in P when Q is allowed to be translated. An occasional lower bound of Ω[(n - m)m + nlog n] is shown for this problem. For the matching the authors study five different algorithms based on the techniques of dynamic programming, point-line duality, instance matching, list traversal, and radix matching.
AB - Given two sets P and Q of n and m (≤n) labeled points, respectively, in plane, the matching problem considered here is to determine all occurrences of Q in P when Q is allowed to be translated. An occasional lower bound of Ω[(n - m)m + nlog n] is shown for this problem. For the matching the authors study five different algorithms based on the techniques of dynamic programming, point-line duality, instance matching, list traversal, and radix matching.
UR - http://www.scopus.com/inward/record.url?scp=0025797830&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0025797830
SN - 0780300335
T3 - Conference Proceedings - IEEE SOUTHEASTCON
SP - 1229
EP - 1232
BT - Conference Proceedings - IEEE SOUTHEASTCON
PB - Publ by IEEE
T2 - IEEE Proceedings of the SOUTHEASTCON '91
Y2 - 8 April 1991 through 10 April 1991
ER -