Journal
ACM TRANSACTIONS ON GRAPHICS
Volume 25, Issue 3, Pages 579-588Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/1141911.1141926
Keywords
minimal perfect hash; multidimensional hashing; sparse data; adaptive textures; vector images; 3D-parameterized textures
Categories
Ask authors/readers for more resources
We explore using hashing to pack sparse data into a compact table while retaining efficient random access. Specifically, we design a perfect multidimensional hash function - one that is precomputed on static data to have no hash collisions. Because our hash function makes a single reference to a small offset table, queries always involve exactly two memory accesses and are thus ideally suited for parallel SIMD evaluation on graphics hardware. Whereas prior hashing work strives for pseudorandom mappings, we instead design the hash function to preserve spatial coherence and thereby improve runtime locality of reference. We demonstrate numerous graphics applications including vector images, texture sprites, alpha channel compression, 3D-parameterized textures, 3D painting, simulation, and collision detection.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available