Linkless octree using multi-level perfect hashing

Computer Graphics Forum

Volumn 28, Issue 7, 2009, Pages 1773-1780

  Choi, Myung Geol ^a   Ju, Eunjung ^a   Chang, Jung Woo ^b   Lee, Jehee ^a   Kim, Young J ^c  

^a Seoul National University   (South Korea)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c Ewha Womans University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

C++ (PROGRAMMING LANGUAGE); DATA STRUCTURES; DIGITAL STORAGE; FORESTRY; IMAGE COMPRESSION; MOTION PLANNING;

COARSE TO FINE; HIERARCHICAL REPRESENTATION; MEMORY OVERHEADS; PERFECT HASHING; RANDOM ACCESSIBILITY; SPATIAL PARTITIONING; STORAGE LOCATION; STORAGE REQUIREMENTS;

TREES (MATHEMATICS);

EID: 71949116983     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/j.1467-8659.2009.01554.x     Document Type: Article

References (20)

1. Benoit D., Demaine E. D., Munro J. I., Raman R., Raman V., Rao S. S. : Representing trees of higher degree. Algorithmica 43, 4 (2005 275 292.
2. Bastos T., Filho W. C : Gpu-accelerated adaptively sampled distance fields. In Proceedings of IEEE International Conference on Hsape Modeling and Applications (2008 pp. 171 178.
3. Castro R., Lewiner T., Lopes H., Tavares G., Bordignon A. : Statistical optimization of octree searches. Computer Graphics Forum 27, 6 (march 2008 1557 1566.
4. Eppstein D., Goodrich M. T., Sun J. Z. : The skip quadtree: Asimple dynamic data structure for multidimensional data. In Proceedings of the 21st Annual Symposium on Computational Geometry (SoCG'05) (2005 pp. 296 305.
5. Fabbrini F., Montani C. : Autumnal quadtrees. The Computer JOURNAL 29, 5 (1986 472 474.
6. Gargantini I. : An effective way to represent quadtrees. Communications of the ACM 25, 12 (1982 905 910.
7. Hudson T. C., Lin M. C., Cohen J., Gottschalk S., Manocha D. : V-collide: accelerated collision detection for vrml. In Proceedings of Symposium on Virtual Reality Modeling Language (VRML '97) (1997).
8. Hunter A., Willis P. J. : Classification of quad-encoding techniques. Computer Graphics Forum 10, 2 (1991 97 112.
9. Jacobson G. : Space-efficient static trees and graphs. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science (SFCS '89) (1989 pp. 549 554.
10. Lee J., Chai J., Reitsma P. S. A., Hodgins J. K., Pollard N. S. : Interactive control of avatars animated with human motion data. ACM Transactions on Graphics (SIGGRAPH 2002) 21, 3 (2002 491 500.
11. Lefebvre S., Hoppe H. : Perfect spatial hashing. ACM Transactions on Graphics (SIGGRAPH 2006) 25, 3 (2006 579 588.
12. Lefebvre S., Hoppe H. : Compressed random-access trees for spatially coherent data. In Proceedings of the Eurographics Symposium on Rendering (2007). 2, 6.
13. Lefohn A. E., Sengupta S., Kniss J., Strzodka R., Owens J. D. : Glift: Generic, efficient, random-access gpu data structures. ACM Transactions on Graphics 25, 1 (2006 60 99.
14. Munro J. I., Raman V. : Succinct representation of balanced parentheses, static trees and planar graphs. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97) (1997 p. 118.
15. Oliver M. A., Wiseman N. E. : Operations on quadtree encoded images. The Computer Journal 26, 1 (1983 83 91.
16. Pharr M., Fernando R. : GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation (Chapter 1. Octree Textures on the GPU). Pearson Education, 2005.
17. Woodwark L. : Compressed quad trees. The Computer Journal 27, 3 (1984 225 229.
18. Warren M. S., Salmon J. K. : A parallel hashed oct-tree n-body algorithm. In Proceedings of the 1993 ACM/IEEE conference on Supercomputing (Supercomputing '93) (1993 pp. 12 21.
19. Zhou K., Hou Q., Wang R., Guo B. : Real-time kd-tree construction on graphics hardware. ACM Transactions on Graphics (SIGGRAPH Asia 2008) 27, 5 (2008 1 11.
20. Zhang L., Kim Y. J., Varadhan G., Manocha D. : Fast c-obstacle query computation for motion planning. In Proceedings of IEEE International Conference on Robotics and Automation (ICRA 2006) (2006 pp. 3035 3040.