MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Radiosity Algorithms Running in Sub-quadratic Time

Download:
Download as a PDF | Download as a PS
unknown authors
http://wscg.zcu.cz/wscg97/papers97/Szirmay_97.ps.gz
Add To MetaCart

Abstract:

Abstract: This paper presents an iterative radiosity algorithm that is capable to determine the radiosity of the patches in O(n log n) time and using only O(n) space. The basic idea is to compute the radiosity updates of all patches in a single direction parallely, requiring only one complete solution of the visibility problem per directions. The visibility problem is solved by painter's algorithm that is responsible for the O(n log n) time complexity, and thus it does not require large amount of z-buffer memory.

Citations

258 An Introduction to Ray Tracing – Glassner - 1989
252 The hemi-cube: A radiosity solution for complex environments – Cohen, Greenberg - 1985
57 Monte Carlo radiosity – Neumann - 1995
44 A quasi-Monte Carlo algorithm for the global illumination in the radiosity setting – Keller - 1995
34 editor). Theory of Three Dimensional Computer Graphics. Akadémia Kiadó – Szirmay-Kalos - 1995
26 Efficient Algorithms for Ray Shooting and Hidden Surface Removal – Berg - 1992
21 A new approach to the shaded picture problem – Newell, Newell, et al. - 1972
11 Rapid hierachical radiosity algorithm – Hanrahan, Salzman, et al. - 1991
4 On convergence and complexity of radiosity algorithms – SZIRMAY-KALOS, MÁRTON - 1995
3 Acceleration of ray tracing via voronoi-diagrams – M'arton - 1995
3 On average-case complexity of ray tracing algorithms – M'arton, Szirmay-Kalos - 1995
3 Efficient binary partitions for hidden-surface removal and solid modeling – Paterson, Yao - 1990
2 Ray-shooting in logarithmic time – F'oris, M'arton, et al. - 1996
1 Form factor evaluation with regional bsp trees – Nechvile, Sochor - 1996
View or Download | Add to My Collection | Correct Errors