Abstract
This paper presents a neighbor-search technique to be used in a GPU-based particle simulation framework. Neighbor searching is usually the most computationally expensive step in particle simulations. The usual approach is to subdivide the simulation space to speed up neighbor search. Here, we present a grid-based neighbor-search technique designed to work on programmable graphics hardware.
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 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.
