Graphics Applications White Papers

Perfect Spatial Hashing

Overview This paper explores using hashing to pack sparse data into a compact table while retaining efficient random access. The paper specifically designs a perfect multidimensional hash function - one that is precomputed on static data to have no hash collisions. Because the 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, the authors instead design the hash function to preserve spatial coherence and thereby improve runtime locality of reference. The paper demonstrates numerous graphics applications including vector images, texture sprites, alpha channel compression, 3D-parameterized textures, 3D painting, simulation, and collision detection.

Further White Paper Details
PublisherMicrosoft File FormatPDF
Date PublishedApril 2006
FormatWhite Papers   
Topics

Quick Sitemap Links: