A Framework for n-Dimensional Visibility Computations
This chapter introduces global visibility computation using Grassmann Algebra. Visibility computation is a fundamental task in computer graphics, as in many other scientific domains. While it is well understood in two dimensions, this does not remain true in higher-dimensional spaces.
Grassmann Algebra allows to think about visibility at a high level of abstraction and to design a framework for solving visibility problems in any n-dimensional space for n≥2. Contrary to Stolfi’s framework which allows only the representation of geometric lines, its algebraic nature deals means general applicability, with no exceptional cases.
This chapter shows how the space of lines can be defined as a projective space over the bivector vector space. Then line classification, a key point for the visibility computation, is achieved using the exterior product. Actually, line classification turns out to be equivalent to point vs. hyperplane classification relative to a nondegenerate bilinear form. This ensures it is well defined and computationally robust.
Using this, the lines stabbing an n-dimensional convex face are characterized. This set of lines appears to be the intersection of the decomposable bivectors set (i.e., bivectors that represent a line) and a convex polytope. Moreover, this convex polytope is proved to be minimal. This property allows useful algorithmic improvements.
To illustrate the use of our framework in practice, we present the computation of soft shadows for three-dimensional illuminated scenes.
KeywordsConvex Polytope Line Space Grassmann Algebra Global Visibility Visibility Query
- 3.Bittner, J.: Hierarchical techniques for visibility computation. PhD thesis, Department of Computer Science and Engineering, Czech Technical University in Prague (2002) Google Scholar
- 5.Dorst, L., Fontijne, D., Mann, S.: Geometric Algebra for Computer Science: An Object-Oriented Approach to Geometry. The Morgan Kaufmann Series in Computer Graphics. Morgan Kaufmann, San Francisco (2007) Google Scholar
- 8.Haumont, D., Makinen, O., Nirenstein, S.: A low dimensional framework for exact polygon-to-polygon occlusion queries. In: Rendering Techniques, pp. 211–222 (2005) Google Scholar
- 9.Möller, T., Trumbore, B.: Fast minimum storage ray–triangle intersection. J. Graph. GPU Game Tools 2(1), 21–28 (1997) Google Scholar
- 11.Mora, F., Aveneau, L., Mériaux, M.: Coherent exact polygon-to-polygon visibility. In: WSCG’05, pp. 87–94 (2005) Google Scholar
- 12.Naylor, B.F., Amanatides, J., Thibault, W.C.: Merging BSP trees yields polyhedral set operations. In: SIGGRAPH, pp. 115–124 (1990) Google Scholar
- 13.Nirenstein, S., Blake, E.H., Gain, J.E.: Exact from-region visibility culling. In: Rendering Techniques, pp. 191–202 (2002) Google Scholar
- 14.Orti, R., Durand, F., Rivière, S., Puech, C.: Using the visibility complex for radiosity computation. In: WACG, pp. 177–190 (1996) Google Scholar
- 15.Pellegrini, M.: Ray shooting and lines in space. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 839–856. Chapman & Hall/CRC Press, Boca Raton (2004) Google Scholar