Abstract

k-Nearest Neighbor Search approach has been used extensively in many fields like computer graphics, data mining, pattern recognition, image processing etc. The k-NN Search approach presented in this paper was realized parallel on GPU architecture with KD-Tree data structure. Experiments show that this approach runs tens of times faster than traditional serial search. This work could be used to speed up photon mapping calculations in real time computer graphics.

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 call

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.