Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
A polynomial time generator for minimal perfect hash functions
Communications of the ACM
Perfect hashing using sparse matrix packing
Information Systems
The spatial complexity of oblivious k-probe Hash functions
SIAM Journal on Computing
Practical minimal perfect hash functions for large databases
Communications of the ACM
Theoretical Computer Science
Multidimensional access methods
ACM Computing Surveys (CSUR)
Painting and rendering textures on unparameterized models
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Pattern based procedural textures
I3D '03 Proceedings of the 2003 symposium on Interactive 3D graphics
Uniform hashing in constant time and linear space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Impulse-based dynamic simulation of rigid body systems
Impulse-based dynamic simulation of rigid body systems
Silhouette maps for improved texture magnification
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Fast and reliable collision culling using graphics hardware
Proceedings of the ACM symposium on Virtual reality software and technology
Real-time texture-mapped vector glyphs
I3D '06 Proceedings of the 2006 symposium on Interactive 3D graphics and games
Glift: Generic, efficient, random-access GPU data structures
ACM Transactions on Graphics (TOG)
Bixels: picture samples with sharp embedded boundaries
EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
Proceedings of the 2007 symposium on Interactive 3D graphics and games
Sliced data structure for particle-based simulations on GPUs
Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia
External perfect hashing for very large key sets
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Parallel white noise generation on a GPU via cryptographic hash
Proceedings of the 2008 symposium on Interactive 3D graphics and games
Precise vector textures for real-time 3D rendering
Proceedings of the 2008 symposium on Interactive 3D graphics and games
Real-time smoke rendering using compensated ray marching
ACM SIGGRAPH 2008 papers
Random-access rendering of general vector graphics
ACM SIGGRAPH Asia 2008 papers
IGT: inverse geometric textures
ACM SIGGRAPH Asia 2008 papers
Distributed perfect hashing for very large key sets
Proceedings of the 3rd international conference on Scalable information systems
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
GigaVoxels: ray-guided streaming for efficient and detailed voxel rendering
Proceedings of the 2009 symposium on Interactive 3D graphics and games
Continuity mapping for multi-chart textures
ACM SIGGRAPH Asia 2009 papers
Rendering surface details with diffusion curves
ACM SIGGRAPH Asia 2009 papers
Real-time parallel hashing on the GPU
ACM SIGGRAPH Asia 2009 papers
ACM Transactions on Graphics (TOG)
Technical Section: Real-time path-based surface detail
Computers and Graphics
Spatio-temporal event stream processing in multimedia communication systems
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
Multiple layer displacement mapping with lossless image compression
Edutainment'10 Proceedings of the Entertainment for education, and 5th international conference on E-learning and games
Data structures for interactive high resolution level-set surface editing
Proceedings of Graphics Interface 2011
Implicit and dynamic trees for high performance rendering
Proceedings of Graphics Interface 2011
Proceedings of the 2011 SIGGRAPH Asia Conference
SMI 2012: Full A runtime cache for interactive procedural modeling
Computers and Graphics
Recovering geometric detail by octree normal maps
Transactions on Edutainment VII
Parameterization-Aware MIP-Mapping
Computer Graphics Forum
Practical perfect hashing in nearly optimal space
Information Systems
Compact, fast and robust grids for ray tracing
EGSR'08 Proceedings of the Nineteenth Eurographics conference on Rendering
Compressed random-access trees for spatially coherent data
EGSR'07 Proceedings of the 18th Eurographics conference on Rendering Techniques
Simple and space-efficient minimal perfect hash functions
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
Real-time 3D reconstruction at scale using voxel hashing
ACM Transactions on Graphics (TOG)
| Hi-index | 0.00 |
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.