Low latency photon mapping using block hashing

Proceedings of the SIGGRAPH/Eurographics Workshop on Graphics Hardware

Volumn , Issue , 2002, Pages 89-98

  Ma, Vincent C H ^a   McCool, Michael D ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BUFFER STORAGE; COLOR COMPUTER GRAPHICS; COMPUTATIONAL METHODS; IMAGE PROCESSING; LIGHT PROPAGATION; LIGHT SOURCES; PHOTONS; RAY TRACING;

BLOCK HASHING; HARDWARE ACCELERATED RENDERING; LOW LATENCY PHOTON MAPPING; TREE-BASED ALGORITHM;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 0036949354     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (48)

1. P.K. Agarwal. Range Searching. In J.E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry. CRC Press, July 1997.
2. P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. Advances in Discrete and Computational Geometry, 23:1-56, 1999.
3. S. Arya and D. M. Mount. Approximate Nearest Neighbor Queries in Fixed Dimensions. In Proc. ACM-SIAM SODA, 1993.
4. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An Optimal Algorithm for Approximate Nearest Neighbor Searching. In Proc. ACM-SIAM SODA, pages 573-582, 1994.
5. J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9), September 1975.
6. J. L. Bentley, B. W. Weide, and A. C. Chow. Optimal Expected-Time Algorithms for Closest Point Problems. ACM TOMS, 6(4), December 1980.
7. Per H. Christensen. Faster Photon Map Global Illumination. Journal of Graphics Tools, 4(3):1-10, 1999.
8. D. Comer. The Ubiquitous B-Tree. ACM Computing Surveys, 11(2):121-137, June 1979.
9. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees. In Proc. ACM-SIAM SODA, volume 10, pages 300-309, 1999.
10. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, 1987.
11. D. Eppstein, M. S. Paterson, and F. F. Yao. On nearest neighbor graphs. Discrete & Computational Geometry, 17(3):263-282, April 1997.
12. C. Faloutsos and Y. Rong. DOT: A Spatial Access Method Using Fractals. In Proc. 7th Int. Conf. on Data Engineering, pages 152-159, Kobe, Japan, 1991.
13. C. Faloutsos and S. Roseman. Fractals for Secondary Key Retrieval. In Proc. 8th ACM PODS, pages 247-252, Philadelphia, PA, 1989.
14. J. H. Freidman, J. L. Bentley, and R. A. Finkel. An Algorithm for Finding Best Matches in Logarithmic Expected Time. ACM TOMS, 3(3):209-226, 1977.
15. V. Gaede and O. Günther. Multidimensional access methods. ACM Computing Surveys (CSUR), 30(2):170-231, 1998.
16. A. Gionis, P. Indyk, and R. Motwani. Similarity Search in High Dimensions via Hashing, In Proc. VLDB, pages 518-529, 1999.
17. J. E. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, July 1997. ISBN: 0849385245.
18. G. Greger, P. Shirley, P. Hubbard, and D. Greenberg. The irradiance volume. IEEE CG&A, 18(2):32-43, 1998.
19. V. Havran. Analysis of Cache Sensitive Representation for Binary Space Partitioning Trees. Informatica, 23(3):203-210, May 2000.
20. P. Indyk and R. Motwani. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In Proc. ACM STOC, pages 604-613, 1998.
21. P. Indyk, R. Motwani, P. Raghavan, and S. Vempala. Locality-Preserving Hashing in Multidimensional Spaces. In Proc. ACM STOC, pages 618-625, 1997.
22. H. V. Jagadish. Linear clustering of objects with multiple attributes. In Proc. Acm-sigmod, pages 332-342, May 1990.
23. J. W. Jaromcyzk and G. T. Toussaint. Relative Neighborhood Graphs and Their Relatives. Proc. IEEE, 80(9):1502-1517, September 1992.
24. H. W. Jensen. Rendering Caustics on Non-Lambertian Surfaces. Computer Graphics Forum, 16(1):57-64, 1997. ISSN 0167-7055.
25. H. W. Jensen. Realistic Image Synthesis Using Photon Mapping. A.K. Peters, 2001.
26. H. W. Jensen, F. Suykens, and P. H. Christensen. A Practical Guide to Global Illumination using Photon Mapping. In SIGGRAPH 2001 Course Notes, number 38. ACM, August 2001.
27. J. K. P. Kuan and P. H. Lewis. Fast k Nearest Neighbour Search for R-tree Family. In Proc. of First Int. Conf. on Information, Communication and Signal Processing, pages 924-928, Singapore 1997.
28. E. P. Lafortune and Y. D. Willems. Using the Modified Phong BRDF for Physically Based Rendering. Technical Report CW197, Department of Computer Science, K.U. Leuven, November 1994.
29. C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001.
30. K.-I. Lin and C. Yang. The ANN-Tree: An Index for Efficient Approximate Nearest-Neighbour Search. In Conf. on Database Systems for Advanced Applications, 2001.
31. N. Linial and O. Sasson. Non-Expansive Hashing. In Proc. acm stoc, pages 509-518, 1996.
32. V. Ma. Low Latency Photon Mapping using Block Hashing. Technical Report CS-2002-15, School of Computer Science, University of Warterloo, 2002.
33. J. McNames. A Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(9):964-976, 2001.
34. J. Nievergelt, H. Hinterberger, and K. C. Sevcik. The Grid File: an adaptable symmetric multikey file structure. ACM TODS, 9(1):38-71, March 1984.
35. T. J. Purcell, I. Buck, W. R. Mark, and P. Hanrahan. Ray Tracing on Programmable Graphics Hardware. In to appear in Proc. SIGGRAPH, 2002.
36. J. T. Robinson. The K-D-B-tree: A Search Structure for Large Multidimensional Dynamic Indexes. In Proc. acm sigmod, pages 10-18, 1981.
37. Arnold L. Rosenberg and Lawrence Snyder. Time- and space-optimality in b-trees. ACM TODS, 6(1):174-193, 1981.
38. K. Salem and H. Garcia-Molina. Disk striping. In IEEE ICDE, pages 336-342, 1986.
39. N. Sample, M. Haines, M. Arnold, and T. Purcell. Optimizing Search Strategies in kd-Trees. May 2001.
40. G. Schaufler and H. W. Jensen. Ray Tracing Point Sampled Geometry. Rendering Techniques 2000 pages 319-328, June 2000.
41. J. Schmittler, I. Wald, and P. Slusallek. SaarCOR - A Hardware Architecture for Ray Tracing. In to appear at Eurographics Graphics Hardware, 2002.
42. M. Smid. Closest-Point Problems in Computational Geometry. In J. R. Sack and J. Urrutia, editors. Handbook on Computational Geometry. Elsevier Science, Amsterdam, North Holland, 2000.
43. P. Tsaparas, Nearest neighbor search in multidimensional spaces. Qualifying Depth Oral Report 319-02, Dept. of Computer Science, University of Toronto, 1999.
44. M. Vanco, G. Brunnett, and T. Schreiber. A Hashing Strategy for Efficient k-Nearest Neighbors Computation. In Computer Graphics International, pages 120-128. IEEE, June 1999.
45. I. Wald, T. Kollig, C. Benthin, A. Keller, and P. Slusallek. Interactive global illumination. Technical report, Computer Graphics Group, Saarland University, 2002. to be published at Eurographics Workshop on Rendering 2002.
46. G. Ward, Real Pixels. In James Arvo, editor, Graphics Gems II, pages 80-83. Academic Press, 1991.
47. Steven Worley. A cellular texture basis function. In Proc. SIGGRAPH 1996, pages 291-294. ACM Press, 1996.
48. M. Zwicker, H. Pfister, J. van Baar, and M. Gross. Surface Splatting. Proc. SIGGRAPH 2001, pages 371-378, 2001.