Linear-time algorithms for finding the shadow volumes from a convex area light source

Algorithmica (New York)

Volumn 20, Issue 3, 1998, Pages 227-241

  Yoo, Kwan Hee ^a   Kim, Dae Seoung ^b   Shin, Sung Yong ^b   Chwa, Kyung Yong ^b  

^a Chungbuk National University   (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Computational geometry; Computer graphics; Penumbra; Umbra

Indexed keywords

EID: 19944383507     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/pl00009194     Document Type: Article

References (18)

1. A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor. A linear-time algorithm for computing Voronoi diagram of a convex polygon. Discrete & Computational Geometry, 4 (1989), 591-604.
2. A. T. Campbell. Modeling Global Diffuse Illumination for Image Synthesis. Ph.D. Thesis, Department of Computer Sciences, University of Texas at Austin, December 1991.
3. A. Campbell and D. S. Fussell. Adaptive mesh generation for global diffuse illumination. Computer Graphics (Proceedings of SIGGRAPH '90), 24(4) (1990), 155-164.
4. M. F. Cohen and J. R. Wallace. Radiosity and Realistic Image Synthesis. Academic Press, New York, 1993.
5. G. Drettakis and E. Fiume. A fast shadow algorithm for area light sources using backprojection. Computer Graphics (Proceedings of SIGGRAPH 94), 28 (1994), 223-230.
6. Z. Gigus, J. Canny, and R. Seidel. Efficiently computing and representing aspect graphs of polyhedral objects. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(6) (1991), 542-551.
7. P. Heckbert. Discontinuity meshing for radiosity. Proceedings of the Third Eurographics Workshop on Rendering, May 1992, pp. 203-226.
8. D. Lischinski, F. Tampieri, and D. P. Greenberg. Discontinuity meshing for accurate radiosity. IEEE Transactions on Computer Graphics and Applications, 12(6) (1992), 25-39.
9. M. Mckenna. Worst-case optimal hidden surface removal. ACM Transaction on Graphics, 6(1) (1987), 19-28.
10. T. Nishita and E. Nakamae. Half-tone representation of 3-D objects illuminated by area sources or polyhedron sources. Proceeding of IEEE COMPSAC, 1983, pp. 237-242.
11. T. Nishita and E. Nakamae. Continuous-tone representation of three-dimensional objects taking account of shadow and interreflection. Computer Graphics (Proceedings of SIGGRAPH '85), 19(3) (1985), 23-30.
12. T. Nishita, I. Okamura, and E. Nakamae. Shading models for point and linear sources. ACM Transaction on Graphics, 4(2) (1985), 124-146.
13. M. S. Paterson and F. F. Yao. Efficient binary partitions for hidden-surface removal and solid modeling. Discrete & Computational Geometry, 5 (1990), 485-503.
14. F. P. Preparata and S. J. Hong. Convex hulls of finite sets of points in two and three dimensions. Communication of the ACM, 2(20) (1977), 87-93.
15. F. P. Preparata and D. E. Muller. Finding the intersection of n half-spaces in time O(n log n). Theoretical Computer Science, 8(1) (1979), 45-55.
16. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
17. A. J. Stewart and S. Ghali. Fast computation of shadow boundaries using spatial coherence and back-projections. Computer Graphics (Proceedings of SIGGRAPH 94), 28 (1994), 231-238.
18. S. J. Teller. Computing the antinumbra of an area light source. Computer Graphics (Proceedings of SIGGRAPH 92), 26(2) (1992), 139-148.