Tree rotations for improving bounding volume hierarchies

RT'08 - IEEE/EG Symposium on Interactive Ray Tracing 2008, Proceedings

Volumn , Issue , 2008, Pages 73-76

  Kensler, Andrew ^a  

^a UNIVERSITY OF UTAH   (United States)

Author keywords

Acceleration structures; Bounding volume hierarchies; Ray tracing; Tree rotations

Indexed keywords

BOUNDING VOLUME HIERARCHIES; BOUNDING VOLUMES; COST VALUES; INTERACTIVE RAY TRACINGS; PRE-PROCESSING; SURFACE AREAS; TOP DOWNS; TOTAL COSTS; TREE ROTATIONS;

ANNEALING; COST BENEFIT ANALYSIS; ELEMENTARY PARTICLE SOURCES; HEURISTIC ALGORITHMS; ROTATION; SIMULATED ANNEALING;

RAY TRACING;

EID: 56649111540     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RT.2008.4634624     Document Type: Conference Paper

References (16)

1. G. M. Adelson-Velsky and Y. M. Landis. An algorithm for the organization of information. Soviet Mathematics Doklady, 3:1259-1262, 1962.
2. S. Anily and A. Federgruen. Simulated annealing methods with general acceptance probabilities. Journal of Applied Probability, 24(3):657-667, September 1987.
3. R. Bayer. Symmetric binary b-trees: Data structure and maintenance algorithms. Acta Informatica, 1:290-306, December 1972.
4. J. Bigler, A. Stephens, and S. G. Parker. Design for parallel interactive ray tracing systems. In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, pages 187-196, September 2006.
5. T. Cassen, K. R. Subramanian, and Z. Michalewicz. Near-optimal construction of partitioning trees by evolutionary techniques. In Graphics Interface '95, pages 263-271, May 1995.
6. J. Goldsmith and J. Salmon. Automatic creation of object hierarchies for ray tracing. IEEE Computer Graphics and Applications, 7(5):14-20, May 1987.
7. V. Havran. Heuristic Ray Shooting Algorithms. PhD thesis, Czech Technical University in Prague, November 2000.
8. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220(4598):671-680, May 1983.
9. J. A. Mahovsky. Ray tracing with reduced-precision bounding volume hierarchies. PhD thesis, University of Calgary, August 2005.
10. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21(6):1087-1092, June 1953.
11. G. Müller and D. W. Fellner. Hybrid scene structuring with application to ray tracing. In Proceedings of the 1999 International Conference on Visual Computing, pages 19-26, February 1999.
12. K. Ng and B. Trifonov. Automatic bounding volume hierarchy generation using stochastic search methods. In CPSC532D Mini-Workshop "Stochastic Search Algorithms", pages 147-161, April 2003.
13. D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652-686, July 1985.
14. V. Černý. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications, 45(1):41-51, January 1985.
15. I. Wald. On fast construction of sah-based bounding volume hierarchies. In Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing, pages 33-40, September 2007.
16. I. Wald, S. Boulos, and P. Shirley. Ray tracing deformable scenes using dynamic bounding volume hierarchies. ACM Transactions on Graphics, 26(1), January 2007.