Performance and elegance of five models of 3 D Euclidean geometry in a ray tracing application ∗
暂无分享,去创建一个
Computations of 3D Euclidean geometry can be performed using various computational models of different effectiveness. In this paper we compare five alternatives: 3D linear algebra, 3D geometric algebra, a mix of 4D homogeneous coordinates and Plücker coordinates, a 4D homogeneous model using geometric algebra, and the 5D conformal model using geometric algebra. Higher dimensional models and models using geometric algebra can express geometric primitives, computations and constructions more elegantly, but this elegance may come at a performance penalty. We explore these issues using the implementation of a simple ray tracer as our practical goal and guide. We show how to implement the most important geometric computations of the ray tracing algorithm using each of the five models and benchmark each implementation. 1
[1] Ron Goldman. On the algebraic and geometric foundations of computer graphics , 2002, TOGS.
[2] Ron Goldman,et al. Illicit expressions in vector algebra , 1985, TOGS.
[3] Jorge Stolfi,et al. Oriented projective geometry , 1987, SCG '87.
[4] Roman Kuchkuda,et al. An introduction to ray tracing , 1993, Comput. Graph..