Abstract
Given two sets P and Q of n and m (<or=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 Omega ((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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
