F. Durand, G. Drettakis, and C. Puech. Fast and accurate hierarchical radiosity using global visibility. ACM Transactions on Graphics, 18(2):128--170, April 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Sum of Squares Theorem for Visibility Complexes and.. - Angelier, Pocchiola (2001) (Correct)
....equivalent to the tangent visibility graph; in particular its set of vertices is in one to one correspondence with the set of free bitangents. Applications of visibility graphs and visibility complexes are found in path planning [31, 27, 13] network optimization [29, 30] global visibility [38, 44, 11, 14], and 1 2 A sum of squares theorem Figure 2: Six steps of the GFA. pattern recognition [20] visibility complexes of simple polygons have been elegantly characterized in the framework of oriented matroid theory [1, 7] as a class of bipartite graphs [34, 35, 46] The related notions of ....
F. Durand, G. Drettakis, and C. Puech. Fast and accurate hierarchical radiosity using global visibility. ACM Transactions on Graphics, 18(2):128-170, 1999.
A 'Sum of Squares' Theorem for Visibility Complexes - Angelier, Pocchiola (2000) (Correct)
.... moving deformable objects in the plane (see [8, 9] or for planning noncolliding motions of linkages via monotone motions (see [10] where rigidity properties of greedy pseudotriangulations are established) A challenging question is to extend these notions and applications to 3D environments (see [11] for a first step. In this paper we focus on the algorithmic of visibility graphs complexes. Our starting point is the socalled Greedy Flip Algorithm (GFA for short) an optimal time and linear working space output sensitive algorithm to compute the visibility complex of obstacles of constant ....
F. Durand, G. Drettakis, and C. Puech. Fast and accurate hierarchical radiosity using global visibility. ACM Transactions on Graphics, 18(2):128--170, 1999.
Algorithmique des Graphes de Visibilité - ANGELIER (2002) Self-citation (Drettakis) (Correct)
No context found.
F. Durand, G. Drettakis, and C. Puech. Fast and accurate hierarchical radiosity using global visibility. ACM Trans. Graph., 18(2):128170, 1999.
Robust Epsilon Visibility - Duguet, Drettakis (2002) (1 citation) Self-citation (Drettakis) (Correct)
....spent on visibility. Although discrete approximations or sampling such as the z buffer or ray casting are often used in practice, analytic methods in which a continuous and precise solution is computed, can be very useful. In particular, for shadow calculations [16, 21, 6] or global illumination [10], the importance and utility of analytic visibility methods has been demonstrated. For virtual environments or games, graphics engines can now handle large polygon counts, even for low end platforms. In certain cases, for games engines or virtual reality, texture memory may be a scarce resource, ....
....Fig. 2(b) where vertices of several leaves of a tree are collinear. Building shadow adjacencies based on a finite set of configurations is no longer possible, since a catalog capable of treating all cases would be infinitely big. Despite treatment of certain cases for the test scenes used in [10], a complete solution is lacking, as mentioned by the authors ( 10] pages 164 166) This fact is also clearly demonstrated by the small size and specific (i.e. custombuilt) nature of the test scenes used in all previous analytic approaches [6, 21, 16, 9, 10] in which the largest test scenes ....
[Article contains additional citation context not shown here]
F. Durand, G. Drettakis, and C. Puech. Fast and accurate hierarchical radiosity using global visibility. ACM Trans. on Graphics, 18(2):128--170, Apr 1999.
Guaranteed Occlusion and Visibility in Cluster Hierarchical.. - Leblanc, Poulin (2000) (1 citation) (Correct)
No context found.
F. Durand, G. Drettakis, and C. Puech. Fast and accurate hierarchical radiosity using global visibility. ACM Transactions on Graphics, 18(2):128--170, April 1999.
The expected number of 3D visibility events is linear - Devillers, al. (2002) (Correct)
No context found.
F. Durand, G. Drettakis, and C. Puech. Fast and accurate hierarchical radiosity using global visibility. ACM Transactions on Graphics, 18:2 (1999), pp. 128-170.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC