Abstract
We explore using perfect spatial hashing to store octrees efficiently while needing no explicit parent-to-child pointers. Specifically, we design a new linkless hierarchical structure – one that encodes the absolute locations of the subdivided nodes using specific tokens and packs these nodes into hash tables using perfect hashing. Whereas prior methods have overhead in space and time due to the unused links and chain of the indirection pointers, our linkless hierarchical structure has lower storage requirements and has an efficient random accessibility on the GPUs. The performance of our scheme is demonstrated on different 2D/3D datasets together with some classical algorithms.
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: DEStech Transactions on Computer Science and Engineering
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.
