“Computing the antipenumbra of an area light source” by Teller

  • ©

Conference:


Type(s):


Title:

    Computing the antipenumbra of an area light source

Presenter(s)/Author(s):


Abstract:


    No abstract available.

References:


    1. E Atherton, K. Weiler, and D. Greenberg. Polygon shadow generation. Computer Graphics (Proc. SIGGRAPH ’78), 12:275-281, 1978.
    2. B. Griinbaum. Convex Polytopes. Wiley-lnterscience, New York, 1967.
    3. Daniel R. Baum, Stephen Mann, Kevin P. Smith, and James M. Winget. Making radiosity usable: Automatic preprocessing and meshing techniques for the generation of accurate radiosity solutions. Computer Graphics (Proc. SIGGRAPH ’91), 25(4):51-60, 1991.
    4. A.T. Campbell Ill and Donald S. Fussell. Adaptive mesh generation for global diffuse illumination. ComputerGraphics (Proc. SIGGRAPH ’91), 24(4):155-164, 1990.
    5. Norman Chin and Steven Feiner. Fast object-precision shadow generation for area light sources using BSP trees. In Proc. 1992 Symposium on Interactive 3D Graphics, pages 21-30, 1992.
    6. Kenneth L. Clarkson and Peter W. Shot. Applications of random sampling in computational geometry {I. Discrete Computational Geometry,, pages 387-421, 1989.
    7. Frank C. Crow. Shadow algorithms for computer graphics. Computer Graphics (Proc. SIGGRAPH ’77), 11(2):242-248, 1977.
    8. H. Fuchs, Z. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. Computer Graphics (Proc. SIG- GRAPH ’80), 14(3): 124-133, 1980.
    9. Thomas A. Funkhouser, Carlo H. S~quin, and Seth J. Teller. Management of large amounts of data in interactive building walkthroughs. In Proc. 1992 Workshop on Interactive 3D Graphics, pages 11-20, 1992.
    10. Ziv Gigus, John Canny, and Raimund Seidel. Efficiently computing and representing aspect graphs of polyhedral objects. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(6):542-551, 1991.
    11. Ziv Gigus and Jitendra Malik. Computing the aspect graph for line drawings of polyhedral objects. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(2):113-122, 1990.
    12. Pat Hanrahan and David Salzman. A rapid hierarchical radiosity algorithm. Computer Graphics (Proc. SIGGRAPH ’91), 25(4): 197-206, 199 i.
    13. Paul S. Heckbert. Simulating Global Illumination Using Adaptive Meshing. PhD thesis, Computer Sciences Department, University of California, Berkeley, June 1991.
    14. J.J. Koenderink and A.J. van Doom. The internal representation of solid shape with respect to vision. Biol. Cybern., 32:211-216, 1979.
    15. Tomoyuki Nishita and Eihachiro Nakamae. Half-tone representation of 3-D objects illuminated by area sources or polyhedron sources. In Proc. IEEE COMPSAC, 1983, pages 237-242, 1983.
    16. Tomoyuki Nishita and Eihachiro Nakamae. Continuous-tone representation of three-dimensional objects taking account of shadows and interreflection. Computer Graphics (Proc. SIG- GRAPH ’85), 19(3):23-30, 1985.
    17. Joseph O’Rourke. Art Gallery. Theorems and Algorithms. Oxford University Press, 1987.
    18. Marco Pellegrini. Stabbing and ray-shooting in 3-dimensional space. In Proc. 6th ACM Symposium on Computational Geometry, pages 177-186, 1990.
    19. Ken Perlin and Xue-Dong Wang. An efficient approximation for penumbra shadow. Technical Report 346~ New York University Courant Institute of Mathematical Sciences, Computer Science Division, 1988.
    20. W.H Plantinga and C.R. Dyer. Visibility, occlusion, and the aspect graph. Int. J. Computer Vision, 5(2):137-160, 1990.
    21. David Salesin, Dani Lischinski, and Tony DeRose. Reconstructing illumination functions with selected discontinuities. In Proc. 3rd Eurographics Workshop on Rendering, 1992.
    22. Raimund Seidel. Linear programming and convex hulls made easy. In Proc. 6th ACM Symposium on Computational Geometry, pages 211-215, 1990.
    23. D.M.Y. Sommerville. Analytical Geometry of Three Dimensions. Cambridge University Press, 1959.
    24. Seth J. Teller and Michael E. Hohmeyer. Computing the lines piercing four lines. Technical Report UCB/CSD 91/665, Computer Science Department, U.C. Berkeley, 1991.
    25. Seth J, Teller and Michael E. Hohmeyer. Stabbing oriented convex polygons in randomized O(n2) time. Technical Report UCB/CSD 91/669, Computer Science Department, U.C. Berkeley, 1992.
    26. Seth J, Teller and Carlo H. S~quin. Visibility preprocessing for interactive walkthroughs. Computer Graphics (Proc. SIG- GRAPH ’91), 25(4):61-69, 1991.
    27. Seth J, Teller and Carlo H. S6quin. Visibility computations in polyhedral three-dimensional environments. Technical Report UCB/CSD 92/680, Computer Science Department, U.C. Berkeley, 1992.

ACM Digital Library Publication:


Overview Page: