Topological changes in the apparent contour of convex sets

We analyse the topological changes occuring in the apparent contour of a collection of disjoint convex sets from a moving viewpoint, and relate them to the classical visual event surfaces, swept by tritangent rays and limiting bitangent rays. Specifically, we show that all topological changes occur as the viewpoint crosses these surfaces or the plane containing some flat object, and that for a subset of these surfaces, such crossings do trigger a topological change in the apparent contour. We also show that these so-called visual event surfaces are likely to be two-dimensional, in the sense that their closure has empty interior. Last, we sketch how this characterization of visual event surfaces led to improved algorithms for the computation of the boundaries of soft shadows induced by area-light sources. Convexity and disjointedness allow elementary proofs and getting rid of the classical distinction between the smooth and polyhedral realms: our results hold for scenes mixing sets that are flat, smooth, piecewise smooth, have infinitely many singularities, are in arbitrarily degenerate position...

[1]  Frédo Durand,et al.  Fast and accurate hierarchical radiosity using global visibility , 1999, TOGS.

[2]  Tomas Akenine-Möller,et al.  An optimized soft shadow volume algorithm with real-time performance , 2003, HWWS '03.

[3]  Seth J. Teller,et al.  Computing the antipenumbra of an area light source , 1992, SIGGRAPH.

[4]  Julien Demouth,et al.  Événements visuels de convexes et limites d'ombres. (Visual Events of Convex Sets and Shadow Boundaries) , 2008 .

[5]  Paul S. Heckbert Discontinuity Meshing for Radiosity , 2007 .

[6]  J. Koenderink,et al.  The internal representation of solid shape with respect to vision , 1979, Biological Cybernetics.

[7]  Claude Puech,et al.  Radiosity and global illumination , 1994 .

[8]  J. H. Rieger On the complexity and computation of view graphs of piecewise smooth algebraic surfaces , 1996, Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[9]  Dani Lischinski,et al.  A Discontinuity Meshing Algorithm for Accurate Radiosity1 , 1992 .

[10]  O. Platonova COMMUNICATIONS OF THE MOSCOW MATHEMATICAL SOCIETY: Singularities of the mutual disposition of a surface and a line , 1981 .

[11]  Edward Cutrell,et al.  Measuring the Perception of Visual Realism in Images , 2001, Rendering Techniques.

[12]  Hazel Everett,et al.  On the Size of the 3D Visibility Skeleton: Experimental Results , 2008, ESA.

[13]  Michael F. Cohen,et al.  Radiosity and realistic image synthesis , 1993 .

[14]  Tomas Akenine-Möller,et al.  A geometry-based soft shadow volume algorithm using graphics hardware , 2003 .

[15]  Leonidas J. Guibas,et al.  On incremental rendering of silhouette maps of polyhedral scene , 2000, SODA '00.

[16]  Sylvain Petitjean,et al.  The enumerative geometry of projective algebraic surfaces and the complexity of aspect graphs , 1996, International Journal of Computer Vision.

[17]  J. Koenderink,et al.  The singularities of the visual mapping , 1976, Biological Cybernetics.

[18]  David J. Kriegman,et al.  Computing exact aspect graphs of curved objects: Solids of revolution , 2004, International Journal of Computer Vision.

[19]  Jitendra Malik,et al.  Computing the Aspect Graph for Line Drawings of Polyhedral Objects , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Daniel J. Velleman American Mathematical Monthly , 2010 .

[21]  George Drettakis,et al.  Robust epsilon visibility , 2002, ACM Trans. Graph..

[22]  Frédo Durand,et al.  The 3D visibility complex , 2002, TOGS.

[23]  Franklin C. Crow,et al.  Shadow algorithms for computer graphics , 1977, SIGGRAPH.

[24]  F. Durand,et al.  The Visibility Skeleton: A Powerful and Multi-Purpose Global Visibility Tool , 1997 .