skip to main content
10.1145/1179352.1141926acmconferencesArticle/Chapter ViewAbstractPublication PagessiggraphConference Proceedingsconference-collections
Article

Perfect spatial hashing

Published: 01 July 2006 Publication History

Abstract

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.

Supplementary Material

JPG File (p579-lefebvre-high.jpg)
JPG File (p579-lefebvre-low.jpg)
High Resolution (p579-lefebvre-high.mov)
Low Resolution (p579-lefebvre-low.mov)

References

[1]
Benson, D., and Davis, J. 2002. Octree textures. ACM SIGGRAPH, 785--790.]]
[2]
Blythe, D. 2006. The Direct 3D 10 system. ACM SIGGRAPH.]]
[3]
Brain, M., and Tharp, A. 1990. Perfect hashing using sparse matrix packing. Information Systems, 15(3), 281--290.]]
[4]
Cantlay, I. 2005. Mipmap-level measurement. GPU Gems II, 437--449.]]
[5]
Czech, Z., Havas, G., and Majewski, B. 1997. Perfect hashing. Theoretical Computer Science 182, 1--143.]]
[6]
Debry, D., Gibbs, J., Petty, D., and Robins, N. 2002. Painting and rendering on unparameterized models. ACM SIGGRAPH, 763--768.]]
[7]
Fox, E., Heath, L., Chen, Q., and Daoud, A. 1992. Practical minimal perfect hash functions for large databases. CACM 33(1), 105--121.]]
[8]
Fredman, M., Komlós, J., and Szemerédi, E. 1984. Storing a sparse table with O(1) worst case access time. JACM31(3), 538--544.]]
[9]
Gaede, V., and Günther, O. 1998. Multidimensional access methods. ACM Computing Surveys 30(2), 170--231.]]
[10]
Govindaraju, N., Lin, M., and Manocha, D. 2004. Fast and reliable collision culling using graphics hardware. Proc. of VRST, 2--9.]]
[11]
Ho, Y. 1994. Application of minimal perfect hashing in main memory indexing. Masters Thesis, MIT.]]
[12]
Kraus, M., and Ertl, T. 2002. Adaptive texture maps. Graphics Hardware, 7--15.]]
[13]
Lefebvre, S., and Neyret, F. 2003. Pattern based procedural textures. Symposium on Interactive 3D Graphics, 203--212.]]
[14]
Lefebvre, S., Hornus, S., and Neyret, F. 2005. Octree textures on the GPU. In GPU Gems II, 595--613.]]
[15]
Lefohn, A., Kniss, J., Strzodka, R., Sengupta, S., and Owens, J. 2006. Glift: Generic, efficient, random-access GPU data structures. ACM TOG 25(1).]]
[16]
Loop, C., and Blinn, J. 2005. Resolution-independent curve rendering using programmable graphics hardware. SIGGRAPH, 1000--1009.]]
[17]
Mehlhorn, K. 1982. On the program size of perfect and universal hash functions. Symposium on Foundations of Computer Science, 170--175.]]
[18]
Mirtich, B. 1996. Impulse-based dynamic simulation of rigid body systems. PhD Thesis, UC Berkeley.]]
[19]
Östlin, A., and Pagh, R. 2003. Uniform hashing in constant time and linear space. ACM STOC, 622--628.]]
[20]
Qin, Z., McCool, M., and Kaplan, C. 2006. Real-time texture-mapped textured glyphs. Symposium on Interactive 3D Graphics and Games.]]
[21]
Ramanarayanan, G., Bala, K., and Walter, B. 2004. Feature-based textures. Eurographics Symposium on Rendering, 65--73.]]
[22]
Ray, N., Cavin, X., and Lévy, B. 2005. Vector texture maps on the GPU. Technical Report ALICE-TR-05-003.]]
[23]
Sager, T. 1985. A polynomial time generator for minimal perfect hash functions. CACM 28(5), 523--532.]]
[24]
Schmidt, J., and Siegel, A. 1990. The spatial complexity of oblivious k-probe hash functions, SIAM Journal on Computing, 19(5), 775--786.]]
[25]
Sen, P., Cammarano, M., and Hanrahan, P. 2003. Shadow silhouette maps. ACM SIGGRAPH, 521--526.]]
[26]
Sen, P. 2004. Silhouette maps for improved texture magnification. Graphics Hardware Symposium, 65--73.]]
[27]
Tarini, M., and Cignoni, P. 2005. Pinchmaps: Textures with customizable discontinuities. Eurographics Conference, 557--568.]]
[28]
Teschner, M., Heidelberger, B., Müller, M., Pomeranets, D., and Gross, M. 2003. Optimized spatial hashing for collision detection of deformable objects. Proc. VMV, 47--54.]]
[29]
Tumblin, J., and Choudhury, P. 2004. Bixels: Picture samples with sharp embedded boundaries. Symposium on Rendering, 186--194.]]
[30]
Winters, V. 1990. Minimal perfect hashing in polynomial time, BIT 30(2), 235--244.]]

Cited By

View all
  • (2021)CUDA Implementation of an Algorithm for Batch Mode Detection of CollisionsParallel Computational Technologies10.1007/978-3-030-81691-9_9(118-133)Online publication date: 9-Jul-2021
  • (2020)Data-Parallel Hashing Techniques for GPU ArchitecturesIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2019.292976831:1(237-250)Online publication date: 1-Jan-2020
  • (2019)Patch texturesProceedings of the Conference on High-Performance Graphics10.2312/hpg.20191194(39-44)Online publication date: 8-Jul-2019
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGGRAPH '06: ACM SIGGRAPH 2006 Papers
July 2006
742 pages
ISBN:1595933646
DOI:10.1145/1179352
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 2006

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. 3D-parameterized textures
  2. adaptive textures
  3. minimal perfect hash
  4. multidimensional hashing
  5. sparse data
  6. vector images

Qualifiers

  • Article

Conference

SIGGRAPH06
Sponsor:

Acceptance Rates

SIGGRAPH '06 Paper Acceptance Rate 86 of 474 submissions, 18%;
Overall Acceptance Rate 1,822 of 8,601 submissions, 21%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)0
Reflects downloads up to 18 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2021)CUDA Implementation of an Algorithm for Batch Mode Detection of CollisionsParallel Computational Technologies10.1007/978-3-030-81691-9_9(118-133)Online publication date: 9-Jul-2021
  • (2020)Data-Parallel Hashing Techniques for GPU ArchitecturesIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2019.292976831:1(237-250)Online publication date: 1-Jan-2020
  • (2019)Patch texturesProceedings of the Conference on High-Performance Graphics10.2312/hpg.20191194(39-44)Online publication date: 8-Jul-2019
  • (2018)PSCCProceedings of the ACM on Computer Graphics and Interactive Techniques10.1145/32031881:1(1-18)Online publication date: 25-Jul-2018
  • (2018)Mobility of Web of Things: A Distributed Semantic Discovery ArchitectureBig Data, Cloud and Applications10.1007/978-3-319-96292-4_20(249-260)Online publication date: 14-Aug-2018
  • (2017)Rethinking texture mappingACM SIGGRAPH 2017 Courses10.1145/3084873.3084911(1-139)Online publication date: 30-Jul-2017
  • (2017)Extending Perfect Spatial Hashing to Index Tuple-based Graphs Representing Super Carbon NanotubesProcedia Computer Science10.1016/j.procs.2017.05.136108(435-444)Online publication date: 2017
  • (2016)Efficient stackless hierarchy traversal on GPUs with backtracking in constant timeProceedings of High Performance Graphics10.5555/2977336.2977343(41-50)Online publication date: 20-Jun-2016
  • (2016)Volume-encoded UV-mapsACM Transactions on Graphics10.1145/2897824.292589835:4(1-13)Online publication date: 11-Jul-2016
  • (2016)JiTTree: A Just-in-Time Compiled Sparse GPU Volume Data StructureIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2015.246733122:1(1025-1034)Online publication date: 31-Jan-2016
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media