Abstract
The multiple-query nearest-neighbor (MQNN) problem is stated as follows: given a set S of n points in plane and a set Q of m(1≤m≤n) query points, determine for every point in Q its closest neighbor in S. Besides the pure theoretical interest, this problem has many practical applications in various areas such as: computer graphics, pattern recognition and image processing. First, this paper proposes a new time-optimal algorithm to solve the all nearest-neighbor (ANN) problem in [Formula: see text] time on a mesh-connected computer of size [Formula: see text]. Next, using this result in conjunction with the generalized multiple search (GMS) paradigm of Bokka et al.3,5 we devise a time-optimal algorithm that solves the MQNN problem in [Formula: see text] time on a mesh with multiple broadcasting (MMB) of size [Formula: see text].
Sign-in/Register to access full text options 
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 callMore From: International Journal of Pattern Recognition and Artificial Intelligence
Disclaimer: 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.
