1 / 1

Perfect Spatial Hashing

Perfect Spatial Hashing. Sylvain Lefebvre Hugues Hoppe (Microsoft Research). We design a perfect hash function to losslessly pack sparse data while retaining efficient random access:. Hash table. Offset table. Hash table. Offset table. 128 3. 38 2. 18 2. 35 3. 19 3. 128 2.

jerry
Download Presentation

Perfect Spatial Hashing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Perfect Spatial Hashing Sylvain Lefebvre Hugues Hoppe(Microsoft Research) • We design a perfect hash function to losslessly pack sparse data while retaining efficient random access: Hash table Offset table Hash table Offset table 1283 382 182 353 193 1282 Hash function Applications 2D 3D • Simply: (modulo table sizes) Offsettable  24372 11632 83333 453 3D textures 3D painting Hashtable H Domain 10243, 46MB, 530fps 20483, 56MB, 200fps Vector images Sprite maps nearest: 7.5MB, 370fps 10242, 500KB, 700fps +900KB, 200fps • Perfect hash on multidimensional data • No collisions  ideal for GPU • Single lookup into a small offset table • Offsets only ~4 bits per defined data • Access only ~4 instructions on GPU • Optimized spatial coherence 1.8% Simulation Collision detection Alpha compression 2563, 100fps 10243, 12MB, 140fps 0.9bits/pixel, 800fps

More Related