Global visibility algorithms for illumination computations

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	John Milligan Airey , Frederick P. Brooks, Jr., Increasing update rates in the building walkthrough system with automatic model-space subdivision and potentially visible set calculations, 1990
	2	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
	3	A. T. Campbell, III , Donald S. Fussell, An Analytic Approach to Illumination with Area Light Sources, University of Texas at Austin, Austin, TX, 1991
	4	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]
	5	Michael F. Cohen , Shenchang Eric Chen , John R. Wallace , Donald P. Greenberg, A progressive refinement approach to fast radiosity image generation, ACM SIGGRAPH Computer Graphics, v.22 n.4, p.75-84, Aug. 1988
	6	Michael F. Cohen , Donald P. Greenberg, The hemi-cube: a radiosity solution for complex environments, ACM SIGGRAPH Computer Graphics, v.19 n.3, p.31-40, Jul. 1985
	7	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
	8	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]
	9	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]
	10	HAINES, E. A., AND WALLACE, J. R. Shaft Culling for Efficient Ray-Traced Radiosity. In Proc. 2~d Eurographics Workshop on Rendering (May 1991).
	11	Pat Hanrahan , David Salzman , Larry Aupperle, A rapid hierarchical radiosity algorithm, ACM SIGGRAPH Computer Graphics, v.25 n.4, p.197-206, July 1991
	12	Paul Seagrave Heckbert, Simulating global illumination using adaptive meshing, University of California at Berkeley, Berkeley, CA, 1992
	13	Dani Lischinski , Filippo Tampieri , Donald P. Greenberg, Discontinuity Meshing for Accurate Radiosity, IEEE Computer Graphics and Applications, v.12 n.6, p.25-39, November 1992 [doi>10.1109/38.163622]
	14	Dani Lischinski , Filippo Tampieri , Donald P. Greenberg, Combining hierarchical radiosity and discontinuity meshing, Proceedings of the 20th annual conference on Computer graphics and interactive techniques, p.199-208, September 1993 [doi>10.1145/166117.166143]
	15	Nimrod Megiddo, Linear Programming in Linear Time When the Dimension Is Fixed, Journal of the ACM (JACM), v.31 n.1, p.114-127, Jan. 1984 [doi>10.1145/2422.322418]
	16	NISHITA, T., AND NAKAMAE, E. Half-Tone Representation of 3-D Objects Illuminated by Area Sources or Polyhedron Sources. In Proc. IEEE COMPSAC, 1983 (1983), pp. 237-242.
	17	PLANTINGA, H. An algorithm for finding the weakly visible faces from a polygon in 3D. Tech. Rep. 92 - 11, U of Pittsburgh, 1992.
	18	PLANTINGA, W., AND DYER, C. An algorithm for constructing the aspect graph. In Proc. 27th Annual IEEE Symposium on Foundations of Computer Science (1986), pp. 123-131.
	19	Raimund Seidel, Small-dimensional linear programming and convex hulls made easy, Discrete & Computational Geometry, v.6 n.5, p.423-434, 1991 [doi>10.1007/BF02574699]
	20	SOMMERVILLE, D. Analytical Geometry of Three Dimensions. Cambridge University Press, 1959.
	21	Seth J. Teller, Computing the antipenumbra of an area light source, ACM SIGGRAPH Computer Graphics, v.26 n.2, p.139-148, July 1992
	22	Seth Jared Teller, Visibility computations in densely occluded polyhedral environments, University of California at Berkeley, Berkeley, CA, 1992
	23	Seth J Teller , Michael E Hohmeyer, Computing the Lines Piercing Four Lines, University of California at Berkeley, Berkeley, CA, 1992
	24	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
	25	ZHAO, J., AND DOBKIN, D. Personal communication, 1992.