Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse




Conference Paper

Object-Space, Connectivity-Preserving, Shadow Computation


Ghali,  Sherif
Computer Graphics, MPI for Informatics, Max Planck Society;

Seidel,  Hans-Peter
Computer Graphics, MPI for Informatics, Max Planck Society;

There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available

Ghali, S., Fiume, E., & Seidel, H.-P. (2000). Object-Space, Connectivity-Preserving, Shadow Computation. In B. Girod, G. Greiner, H. Niemann, & H.-P. Seidel (Eds.), Proceedings of Vision, Modeling, and Visualization (VMV-00) (pp. 281-289). Berlin, Germany: Akademische Verlagsgesellschaft Aka.

Cite as:
Known shadow algorithms can be classified as either mapping techniques or as geometric techniques. Both involve computing visibility from a viewer located at the light source, but whereas algorithms in the first category compute a texture to be mapped on the surfaces in the scene, algorithms in the second category destruct the scene geometry to build lit and unlit polygon lists. We describe in this paper an algorithm that lies in the second category, but one that is non--destructive. Namely, the algorithm we propose ensures that all connectivity in the scene remains intact and thus that adjacency information, which is important in a solid modeling environment, remains intact.