Statistical optimization of octree searches

Computer Graphics Forum

Volumn 27, Issue 6, 2008, Pages 1557-1566

  Castro, Rener ^a   Lewiner, Thomas ^a   Lopes, H́elio ^a   Avares, Geovan ^a   Bordignon, Alex ^a  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Collision detection; Data structures; Hashing; Octree; Quadtree; Statistical optimization

Indexed keywords

COMPUTER GRAPHICS; DATA STRUCTURES;

COLLISION DETECTION; HASHING; OCTREE; QUAD TREES; STATISTICAL OPTIMIZATION;

COST BENEFIT ANALYSIS;

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

References (12)

1. [BHGS06] BOUBEKEUR T., HEIDRICH W., GRANIER X., SCHLICK C.: Volume-Surface Trees. Computer Graphics Forum 25, 3 (2006), 399-406.
2. [BWK02] BOTSCH M., WIRATANAYA A., KOBBELT L.: Efficient high quality rendering of point sampled geometry. In Eurographics Workshop on Rendering (2002), pp. 53-64.
3. [DVS03] DACHSBACHER C., VOGELGSANG C., STAMMINGER M.: Sequential point trees. In SIGGRAPH (2003), pp. 657-662.
4. [Gar82] GARGANTINI I.: Linear octrees for fast processing of three-dimensional objects. Computer Graphics and Image Processing 4, 20 (1982), 365-374.
5. [GDB03] GUMEROV N. A., DURAISWAMI R., BOROVIKO E. A.: Data Structures, Optimal Choice of Parameters, and Complexity Results for Generalized Multilevel Fast Multipole Methods in d Dimensions. Tech. rep., University of Maryland, 2003.
6. [Gla84] GLASSNER A.: Space subdivision for fast ray tracing. Computer Graphics & Applications 4, 10 (1984), 15-22.
7. [Mor66] MORTON G. M.: A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing. IBM, 1966.
8. [Sam89] SAMET H.: Applications of Spatial Data Structures. Adison-Wesley, Reading, 1989.
9. [Sch92] SCHRACK G.: Finding neighbours of equal size in linear quadtrees and octrees in constant time. Computer Vision, Graphics and Image Processing 55, 3 (1992), 221-230.
10. [SS95] STOCCO L., SCHRACK G.: lnteger dilation and contraction for quadtrees and octrees. In Communications, Computers and Signal Processing (1995), IEEE, pp. 426-428.
11. [SW03] SCHAEFER S., WARREN J.: Adaptive vertex clustering using octrees. Geom. Design and Computing (2003), 491-500.
12. [WS93] WARREN M. S., SALMON J. K.: A parallel hashed octtree N-body algorithm. In Supercomputing (1993), 12-21.