Computing the antipenumbra of an area light source

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Peter Atherton , Kevin Weiler , Donald Greenberg, Polygon shadow generation, Proceedings of the 5th annual conference on Computer graphics and interactive techniques, p.275-281, August 23-25, 1978
	2	B. Griinbaum. Convex Polytopes. Wiley-lnterscience, New York, 1967.
	3	Daniel R. Baum , Stephen Mann , Kevin P. Smith , James M. Winget, Making radiosity usable: automatic preprocessing and meshing techniques for the generation of accurate radiosity solutions, ACM SIGGRAPH Computer Graphics, v.25 n.4, p.51-60, July 1991
	4	A. T. Campbell, III , Donald S. Fussell, Adaptive mesh generation for global diffuse illumination, ACM SIGGRAPH Computer Graphics, v.24 n.4, p.155-164, Aug. 1990
	5	Norman Chin , Steven Feiner, Fast object-precision shadow generation for area light sources using BSP trees, Proceedings of the 1992 symposium on Interactive 3D graphics, p.21-30, June 1992, Cambridge, Massachusetts, United States [doi>10.1145/147156.147159]
	6	K. L. Clarkson , P. W. Shor, Applications of random sampling in computational geometry, II, Discrete & Computational Geometry, v.4 n.5, p.387-421, 1989 [doi>10.1007/BF02187740]
	7	Franklin C. Crow, Shadow algorithms for computer graphics, Proceedings of the 4th annual conference on Computer graphics and interactive techniques, p.242-248, July 20-22, 1977, San Jose, California
	8	Henry Fuchs , Zvi M. Kedem , Bruce F. Naylor, On visible surface generation by a priori tree structures, Proceedings of the 7th annual conference on Computer graphics and interactive techniques, p.124-133, July 14-18, 1980, Seattle, Washington, United States
	9	Thomas A. Funkhouser , Carlo H. Séquin , Seth J. Teller, Management of large amounts of data in interactive building walkthroughs, Proceedings of the 1992 symposium on Interactive 3D graphics, p.11-20, June 1992, Cambridge, Massachusetts, United States [doi>10.1145/147156.147158]
	10	Ziv Gigus , John Canny , Raimund Seidel, Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.13 n.6, p.542-551, June 1991 [doi>10.1109/34.87341]
	11	Z. Gigus , J. Malik, Computing the Aspect Graph for Line Drawings of Polyhedral Objects, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.12 n.2, p.113-122, February 1990 [doi>10.1109/34.44399]
	12	Pat Hanrahan , David Salzman , Larry Aupperle, A rapid hierarchical radiosity algorithm, ACM SIGGRAPH Computer Graphics, v.25 n.4, p.197-206, July 1991
	13	Paul Seagrave Heckbert, Simulating global illumination using adaptive meshing, University of California at Berkeley, Berkeley, CA, 1992
	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 , Eihachiro Nakamae, Continuous tone representation of three-dimensional objects taking account of shadows and interreflection, ACM SIGGRAPH Computer Graphics, v.19 n.3, p.23-30, Jul. 1985
	17	Joseph O'Rourke, Art gallery theorems and algorithms, Oxford University Press, Inc., New York, NY, 1987
	18	Marco Pellegrini, Stabbing and ray shooting in 3 dimensional space, Proceedings of the sixth annual symposium on Computational geometry, p.177-186, June 07-09, 1990, Berkley, California, United States [doi>10.1145/98524.98563]
	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	Harry Plantinga , Charles R. Dyer, Visibility, occlusion, and the aspect graph, International Journal of Computer Vision, v.5 n.2, p.137-160, Nov. 1990 [doi>10.1007/BF00054919]
	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, Proceedings of the sixth annual symposium on Computational geometry, p.211-215, June 07-09, 1990, Berkley, California, United States [doi>10.1145/98524.98570]
	23	D.M.Y. Sommerville. Analytical Geometry of Three Dimensions. Cambridge University Press, 1959.
	24	Seth J Teller , Michael E Hohmeyer, Computing the Lines Piercing Four Lines, University of California at Berkeley, Berkeley, CA, 1992
	25	Seth J Teller , Michael E Hohmeyer, Stabbing Oriented Convex Polygons in Randomized O(n2) Time, University of California at Berkeley, Berkeley, CA, 1992
	26	Seth J. Teller , Carlo H. Séquin, Visibility preprocessing for interactive walkthroughs, ACM SIGGRAPH Computer Graphics, v.25 n.4, p.61-70, July 1991
	27	Seth J Teller , Carlo H. Sequin, Visibility Computations in Polyhedral Environments, University of California at Berkeley, Berkeley, CA, 1992