Perfect spatial hashing
- 1 July 2006
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 25 (3), 579-588
- https://doi.org/10.1145/1141911.1141926
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- GliftACM Transactions on Graphics, 2006
- Resolution independent curve rendering using programmable graphics hardwareACM Transactions on Graphics, 2005
- Shadow silhouette mapsACM Transactions on Graphics, 2003
- Octree texturesACM Transactions on Graphics, 2002
- Painting and rendering textures on unparameterized modelsACM Transactions on Graphics, 2002
- Multidimensional access methodsACM Computing Surveys, 1998
- Practical minimal perfect hash functions for large databasesCommunications of the ACM, 1992
- Minimal perfect hashing in polynomial timeBIT Numerical Mathematics, 1990
- A polynomial time generator for minimal perfect hash functionsCommunications of the ACM, 1985
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984