The 3D visibility complex

ACM Transactions on Graphics

Volumn 21, Issue 2, 2002, Pages 176-206

  Durand, Frédo ^a,d   Drettakis, George ^b,d   Puech, Claude ^c,d  

^a INRIA   (France)

^b INRIA   (France)

^c iMAGIS GRAVIR/IMAGE INRIA   (France)

^d INRIA RHÔNE ALPES   (France)

Author keywords

Line space; Visibility classification; Visibility complex; Visibility skeleton

Indexed keywords

LINE SPACE; VISIBILITY CLASSIFICATION; VISIBILITY COMPLEX; VISIBILITY SKELETON;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; IMAGE SEGMENTATION; VISIBILITY;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 0141658791     PISSN: 07300301     EISSN: 07300301     Source Type: Journal    
DOI: 10.1145/508357.508362     Document Type: Article

References (55)

1. ADELSON, E. H. AND BERGEN, J. R. 1991. The plenoptic function and the elements of early vision. M. Landy and J. A. Moushon, (eds) Computational Models of Visual Processing, 3-20.
2. BOISSONNAT, J.-D. AND YVINEC, M. 1998. Algorithmic Geometry. Cambridge University Press.
3. COLLINS, G. 1975. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Proceedings of the Second GI Conference on Automata Theory and Formal Languages. Volume 33 of Lecture Notes in Computer Science. Springer-Verlag (Berlin, 1975), pp. 134-183.
4. COORG, S. AND TELLER, S. J. 1996. Temporally coherent conservative visibility. In Proceedings of the Twelfth Annual Symposium On Computational Geometry (SoCG '96). ACM Press, http://graphics.lcs.mit.edu/~satyan/pubs.html (Philadelphia, May 1996), pp. 78-87.
5. COORG, S. AND TELLER, S. J. 1997. Real-time occlusion culling for models with large occluders. In Proceedings of the Symposium on Interactive 3D Graphics. ACM Press. http:/graphics.lcs.mit.eduTsatyan/pubs.html (April 27-30 1997), pp. 83-90.
6. DE BERG, M., KATZ, M. J., VAN DER STAPFEN, A. F., AND VLEUGELS, J. 1997. Realistic input model for geometric algorithms. In Proceedings of the 13th International Annual Symposium on Computational Geometry (SoCG-97) ACM Press (Nice, June 4-6 1997), pp. 294-303.
7. DRETTAKIS, G. AND FIUME, E. 1994. A fast shadow algorithm for area light sources using backprojection. Computer Graphics 28, Annual Conference Series (July), 223-230. http://www-imagis.imag.fr/~George.Drettakis/pub.html.
8. DURAND, F. 1999. 3D Visibility, analysis and applications. Ph.D. dissertation, Univeristé Joseph Fourier, Grenoble, http:// www-imagis.imag.fr.
9. DURAND, F., DRETTAKIS, G., AND PUECH, C. 1996. The 3D visibility complex: A new approach to the problems of accurate visibility. In X. PUEYO AND P. SCHRÖDER Eds., Eurographics Rendering Workshop 1996, Eurographics, Springer Wein, ISBN 3-211-82883-4, http://www-imagis.imag.fr/Publications/ (Porto, Portugal, June 1996), pp. 245-256.
10. DURAND, F., DRETTAKIS, G., AND PUECH, C. 1997a. The 3D visibility complex: a unified data-structure for global visibility of scenes of polygons and smooth objects. In Canadian Conference on Computational Geometry (Aug. 1997). http:/Awwwimagis.imag.fr/Tredo.Durand.
11. DURAND, F., DRETTAKIS, G., AND PUECH, C. 1997b. The visibility skeleton: A powerful and efficient multi-purpose global visibility tool. In SIGGRAPH 97 Conference Proceedings, Annual Conference Series ACM SIGGRAPH: Addison Wesley (Aug. 1997), pp. 89-100.
12. DURAND, F., DRETTAKIS, G., AND PUECH, C. 1999. Fast and accurate hierarchical radiosity using global visibility. ACM Trans. Graphics 18, 2 (April), 128-170.
13. DURAND, F., ORTI, R., RIVIÈRE, S., AND PUECH, C. 1996. Radiosity in flatland made visibly simple. In video of the 12th Annual ACM Symposium on Computational Geometry (1996).
14. DURAND, F. AND PUECH, C. 1995. The visibility complex made visibly simple. In video of the 11th Annual ACM Symposium on Computational Geometry (1995).
15. EGGERT, D., BOWYER, K., AND DYER, C. R. 1992. Aspect graphs: State-of-the-art and applications in digital photogrammetry. In Proceedings of the 17th Congress of the International Society for Photogrammetry and Remote Sensing, Part B5 (1992), pp. 633-645.
16. GIGUS, Z. AND MALIK, J. 1990. Computing the aspect graph for the line drawings of polyhedral objects. IEEE Trans. Pat. Match. Mach. Intell. 12, 2 (Feb.), 113-122.
17. GORTLER, S. J., GRZESZCZUK, R., SZELISH, R., AND COHEN, M. F. 1996. The lumigraph. In H. Rushmeier Ed., SIGGRAPH 96 Conference Proceedings, Annual Conference Series, ACM SIGGRAPH: Addison Wesley (Aug. 1996), pp. 43-54.
18. GUIBAS, L. J., LATOMBE, J.-C., LAVALLE, S. M., LIN, D., AND MOTWANI, R. 1999. Visibility-based pursuit-evasion in a polygonal environment. In. J. Comput. Geom. Appl. 5 (Oct.), 471-494.
19. HATCHER, A. 2001. Algebraic Topology. Cambridge University Press.
20. HOLZSCHUCH, N-, SILIJON, F., AND DRETTAKIS, G. 1994. An Efficient Progressive Refinement Strategy for Hierarchical Radiosity. In Proceedings of the Fifth Eurographics Workshop on Rendering (Darmstadt, Germany, June 1994), pp. 343-357. http://www.loria.fr/~holzschu.
21. KERGOSIEN, Y. L. 1981. La famille des projections orthogonales d'une surface et ses singularités. Compte Rendu de l'Académie des Sciences, Paris 292, 929-932.
22. KOENDERINK, J. J. 1987. An internal representation for solid shape based on the topological properties of the apparent contour. In W. Richards and S. Ullman, Eds., Image Understanding 1985-86 (Norwood, NJ, 1987), pp. 257-285. Ablex.
23. KOENDERINK, J. J. AND VANDOORN, A. J. 1976. The singularities of the visual mapping. BioCyber24, 1, 51-59.
24. KOENDERINK, J. J. AND VAN DOORN, A. J. 1979. The internal representation of solid shape with respect to vision. BioCyber 32, 211-216.
25. KOLTUN, V. 2001. Almost tight upper bounds for vertical decompositions in four dimensions. In Proceedings of the 42nd Symposium on Foundations of Computer Science (2001). http^/www.math.tau.ac.il/vladlen/.
26. LANGER, M. S. AND ZUCKER, S. W. 1997. Casting light on illumination: A computational model and dimensional analysis of sources. Computer Vision and Image Understanding: CVIU 65, (Feb.), 322-335.
27. LAURENTINI, A. 1994. The visual hull concept for silhouette-based image understanding. IEEE Trans. Patt. Match. Mach. Intell. 16, 150-162.
28. LEVOY, M. AND HANRAHAN, P. 1996. Light field rendering. In H. Rushmeier, Ed. SIGGRAPH 96 Conference Proceedings, Annual Conference Series (Aug. 1996), pp. 31-12, ACM SIGGRAPH: Addison Wesley, held in New Orleans, Louisiana, 04-09 August 1996, http://www-graphics.stanford.edu/papers/light/.
29. MATHAI, A. M. 1999. An Introduction to Geometrical Probability. Gordon and Breach Science Publishers.
30. MULMULEY, K. 1991. Hidden surface removal with respect to a moving view point (extended abstract). In ACM Symposium on Theory of Computing (STOC) (1991), pp. 512-522.
31. ORTI, R., RIVIÈRE, S., DURAND, F., AND PUECH, C. 1996. Radiosity for dynamic scenes in flatland with the visibility complex. In J. Rossignac and F. Sillion, Eds. Computer Graphics Forum (Proceedings of Eurographics '96), Volume 16(3) (Poitiers, France, Sept. 1996), pp. 237-249.
32. PELLEGRINI, M. 1993. Ray shooting on triangles in 3-space. Algorithmica 9, 471-494.
33. PETITJEAN, S. 1992. Computing exact aspect graphs of smooth objects bounded by smooth algebraic surfaces. Master's dissertation, University of Illinois, Urbana-Champaign, IL. available as Tech. Rep. UIUC-BI-AI-RCV-92-04.
34. PETITJEAN, S. 1995. The number of views of piecewise-smooth algebraic objects. In Proceedings of the Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 900, 571-582.
35. PETITJEAN, S. 1996. The enumerative geometry of projective algebraic surfaces and the complexity of aspect graphs. Int. J. Comput. Vision 19, 3, 1-27.
36. PETITJEAN, S., POXCE, J., AND KRIEGMAN, D. J. 1992. Computing exact aspect graphs of curved objects: Algebraic surfaces. Int. J. Comput. Vision 9, 3, 231-255.
37. PLANTINGA, H. AND DYER, C. R. 1990. Visibility, occlusion, and the aspect graph. Int. J. Comput. Vision 5, 2, 137-160.
38. POCCHIOLA, M. AND VEGTER, G. 1996a. Topologically sweeping visibility complexes via pseudotriangulations. Discrete & Computational Geometry 16, 419-453.
39. POCCHIOLA, M. AND VEGTER, G. 1996b. The visibility complex. Int. J. Comput. Geom. Appl., special issue devoted to ACMSoCG'93, 279-308.
40. RADEMACHER, P. AND BISHOP, G. 1998. Multiple-center-of-projection images. In M. Cohen, Ed. SIGGRAPH 98 Conference Proceedings, Annual Conference Series (July 1998), pp. 199-206. ACM SIGGRAPH: Addison Wesley, ISBN 0-89791-999-8.
41. RIEGER, J. H. 1987. On the classification of views of piecewise smooth objects. Image and Vision Computing 5, 91-97.
42. RIEGER, J. H. 1990. The geometry of view space of opaque objects bounded by smooth surfaces. Artificial Intelligence(1-2) 44, 1-40.
43. RIEGER, J. H. 1992. Global bifurcation sets and stable projections of non-singular algebraic surface. Int. J. Comput. Vision 7, 3, 171-194.
44. RIEGER, J. H. 1993. Computing view graphs of algebraic surfaces. J. Symbol. Comput. 16, 3 (Sept.), 259-272.
45. RIVIÈRE, S. 1997a. Calculs de visibilité dans un environnement polygonal 2D. Ph.D. dissertation Université Joseph Fourier (Grenoble).
46. RIVIÈRE, S. 1997b. Dynamic visibility in polygonal scenes with the visibility complex. In Communication 13th Annual ACM Symposium on Computational Geometry (1997), pp. 421-423.
47. SANTALÓ, L. A. 1976. Integral Geometry and Geometric Probability. Addison-Wesley, Reading, MA.
48. SBERT, M. 1993. An integral-geometry-based method for fast form-factor computation. Computer Graphics Forum 12, 3, C409-C420.
49. SEMPLE, J. AND KNEEBONE, G. 1952. Algebraic projective geometry. Oxford University Press.
50. SILLION, F. AND PUECH, C. 1994. Radiosity and Global Illumination. Morgan Kaufmann, San Francisco, CA.
51. SOMMERVILLE, D. M. Y. 1951. Analytical Geometry in Three Dimensions. Cambridge University Press, Cambridge.
52. STOLFI, J. 1991. Oriented Projective Geometry: A Framework for Geometric Computations. Academic Press.
53. TELLER, S. J. 1992a. Computing the antipenumbra of an area light ource. In E. E. Catmull, Ed., Computer Graphics (SIGGRAPH '92 Proceedings), Volume 26-2 (July 1992), pp. 139-148. httpy/graphics.lcs.mit.edu/~seth/pubs/pubs.html.
54. TELLER, S. J. 1992b. Visibility Computations in Densely Occluded Polyhedral Environments. Ph.D. dissertation, CS Division, UC Berkeley. Tech. Rep. UCB/CSD-92-708, httpy/graphics.lcs.mit.edu/~seth/pubs/pubs.html.
55. THOM, R. 1972. Structural Stability and Morphogenesis. Benjamin, New-York.