Frédo Durand
George Drettakis
- 1.James Arvo and David B. Kirk. Fast ray tracing by ray classification. In Maureen C. Stone, editor, Computer Graphics (SIGGRAPH '87 Proceedings), volume 21, pages 55-64, July 1987. Google Scholar
Digital Library
- 2.Daniel R. Baum, Holly E. Rushmeier, and James M. Winget. Improving radiosity solutions through the use of analytically determined tbrm-factors. Computer Graphics, 23(3):325-334, July 1989. Proceedings SIGGRAPH '89 in Boston, USA. Google ScholarDigital Library
- 3.Daniel R. Baum, John R. Wallace, Michael F. Cohen, and Donald P. Greenberg. The back-buffer algorithm : an extension of the radiosity method to dynamic environments. The Visual Computer, 2:298-306, 1986.Google ScholarCross Ref
- 4.Michael F. Cohen and Donald P. Greenberg. The hemi-cube : A radiosity solution for complex environments. Computer Graphics, 19(3):31-40, July 1985. Proceedings SIGGRAPH '85 in San Francisco (USA). Google ScholarDigital Library
- 5.George Drettakis and Eugene Fiume. A fast shadow algorithm for area light sources using back projection. In Andrew Glassner, editor, SIGGRAPtt 94 Conference P1vceedings (Orlando, FL), Annual Conference Series, pages 223-230. ACM SIGGRAPH, July 1994. Google ScholarDigital Library
- 6.George Drettakis and Francois Sillion. Accurate visibility and meshing calculations for hierarchical radiosity. In X. Pueyo and R Shr6der, editors, Rendering Techniques '96, pages 269-279. Springer Verlag, June 1996. Proc. 7th EG Workshop on Rendering in Porto. Google ScholarDigital Library
- 7.Fr6do Durand, George Drettakis, and Claude Puech. The 3d visibility complex, a new approach to the problems of accurate visibility. In X. Pueyo and R Shr6der, editors, Rendering Techniques '96, pages 245-257. Springer Verlag, June 1996. Proc. 7th EG Workshop on Rendering in Porto. Google ScholarDigital Library
- 8.David W. George, Frangois Sillion, and Donald R Greenberg. Radiosity redistribution for dynamic environments. IEEE Computer Graphics and Applications, 10(4), July 1990. Google ScholarDigital Library
- 9.Ziv Gigus, John Canny, and Raimund Seidel. Efficiently computing and representing aspect graphs of polyhedral objects. IEEE Trans. on Pat. Matching & Mach. Intelligence, 13(6), June 1991. Google ScholarDigital Library
- 10.Ziv Gigus and Jitendra Malik. Computing the aspect graph for the line drawings of polyhedral objects. IEEE Trans. on Pat. Matching & Mach. Intelligence, 12(2), February 1990. Google ScholarDigital Library
- 11.Eric A. Haines. Shaft culling for efficient ray-traced radiosity. In Brunet and Jansen, editors, Photorealistic Rendering in Comp. Graphics, pages 122-138. Springer Verlag, 1993. Proc. 2nd EG Workshop on Rendering (Barcelona, 1991).Google Scholar
- 12.Pat Hanrahan, David Saltzman, and Larry Aupperle. A rapid hierarchical radiosity algorithm. Computer Graphics, 25(4):197-206, August 1991. SIG- GRAPH '91 Las Vegas. Google ScholarDigital Library
- 13.Stephen Hardt and Seth Teller. High-fidelity radiosity rendering at interactive rates. In X. Pueyo and R Shr6der, editors, Rendering Techniques '96. Springer Verlag, June 1996. Proc. 7th EG Workshop on Rendering in Porto. Google ScholarDigital Library
- 14.Paul Heckbert. Discontinuity meshing for radiosity. Third Emvgraphics Workshop on Rendering, pages 203-226, May 1992.Google Scholar
- 15.Michael Mc Kenna and Joseph O'Rourke. Arrangements of lines in space: A data structure with applications. In P~vc. 4th Annu. ACM Sympos. Comput. Geom., pages 371-380, 1988. Google ScholarDigital Library
- 16.Dani Lischinski, Brian Smits, and Donald R Greenberg. Bounds and error estimates for radiosity. In Andrew S. Glassner, editor, SIGGRAPH 94 Conference P1vceedings (Orlando, FL), Annual Conference Series, pages 67-74. ACM SIG- GRAPH, July 1994. Google ScholarDigital Library
- 17.Dani Lischinski, Filippo Tampieri, and Donald R Greenberg. Discontinuity meshing for accurate radiosity. IEEE Computer Graphics and Applications, 12(6):25-39, November 1992. Google ScholarDigital Library
- 18.Dani Lischinski, Filippo Tampieri, and Donald R Greenberg. Combining hierarchical radiosity and discontinuity meshing. In Jim Kajiya, editor, SIGGRAPtt 93 Conference P1vceedings (Anaheim, CA), Annual Conference Series, pages 199- 208. ACM SIGGRAPH, August 1993. Google ScholarDigital Library
- 19.Rachel Orti, St6phane Rivibre, Fr6do Durand, and Claude Puech. Radiosity for dynamic scenes in flatland with the visibility complex. In Jarek Rossignac and Frangois Sillion, editors, Computer Graphics Forum (P1vc. of Emvgraphics '96), volume 16, pages 237-249, Poitiers, France, September 1996.Google ScholarCross Ref
- 20.M. Pellegrini. Stabbing and ray shooting in 3-dimensional space. In Proc. 6th Annu. ACM Sympos. Comput. Geom., pages 177-186, 1990. Google ScholarDigital Library
- 21.H. Plantinga and C. R. Dyer. Visibility, occlusion, and the aspect graph. Internat. J. Comput. Vision, 5(2):137-160, 1990. Google ScholarDigital Library
- 22.M. Pocchiola and G. Vegter. The visibility complex. 1996. special issue devoted to ACM-SoCG'93. Google ScholarDigital Library
- 23.Erin Shaw. Hierarchical radiosity for dynamic environments. Master's thesis, Comell University, Ithaca, NY, August 1994.Google Scholar
- 24.A. James Stewart and Sherif Ghali. Fast computation of shadow boundaries using spatial coherence and backprojections. In Andrew Glassner, editor, SIG- GRAPH 94 Conference P1vceedings (Orlando, FL), Annual Conference Series, pages 231-238. ACM SIGGRAPH, July 1994. Google ScholarDigital Library
- 25.Filippo Tampieri. Discontinuity Meshing for Radiosity Image Synthesis. PhD thesis, Department of Computer Science, Comell University, Ithaca, New York, 1993. PhD Thesis. Google ScholarDigital Library
- 26.Seth J. Teller. Computing the antipenumbra of an area light source. Computer Graphics, 26(4):139-148, July 1992. Proc. SIGGRAPH '92 in Chicago. Google ScholarDigital Library
- 27.Seth J. Teller and Patrick M. Hanrahan. Global visibility algorithms for illumination computations. In J. Kajiya, editor, SIGGRAPH 93 Conf. P1vc. (Anaheim), Annual Conf. Series, pages 239-246. ACM SIGGRAPH, August 1993. Google ScholarDigital Library
- 28.Seth J. Teller and Michael E. Hohmeyer. Computing the lines piercing tour lines. Technical report, CS Dpt. UC Berkeley, 1991. Google ScholarDigital Library
- 29.John R. Wallace, Kells A. Elmquist, and Eric A. Haines. A ray tracing algorithm for progressive radiosity. Computer Graphics, 23(3):315-324, July 1989. Proceedings SIGGRAPH '89 in Boston. Google ScholarDigital Library
Recommendations
Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
AbstractWe devise an algorithm for maintaining the visibility polygon of any query point in a dynamic polygonal domain, i.e., as the polygonal domain is modified with vertex insertions and deletions to its obstacles, we update the data structures that ...
Visibility maps of segments and triangles in 3D
Let T be a set of n triangles in three-dimensional space, let s be a line segment, and let t be a triangle, both disjoint from T. We consider the subdivision of T based on (in)visibility from s; this is the visibility map of the segment s with respect ...
Characterizing and recognizing LR-visibility polygons
A simple polygon P is LR-visible if there are two points s, t on the boundary of P such that every point on the clockwise boundary of P from s to t is visible from some point of the other boundary of P from t to s and vice versa. We show that P is not ...
Comments