This thesis presents an approach to optimizing the computation of soft shadows from area lights. The light source is sampled uniformly by traversing shadow rays as packets through an N-tree. This data structure stores an additional line space for every node. A line space stores precomputed information about geometry inside of shafts from one to another side of the node. This visibility information is used to terminate a ray. Additionally the graphics processing unit (short GPU) is used to speed up the computations through parallelism. The scene is rendered with OpenGL and the shadow value is computed on the GPU for each pixel. Evaluating the implementation shows a performance gain of 86% by comparison to the CPU, if using the GPU implementation. Using the line space instead of triangle intersections also increases the performance. The implementation provides good scaling with an increasing amount of triangles and has no visual disadvantages for many rays.
This thesis presents the use of a local linespace data structure, which is designed and implemented on the basis of an existing GPU-based raytra- cer with a global linespace data structure. For each scene object, an N-tree is generated whose nodes each have a linespace. This saves informations about existing geometry in its shafts. A shaft represents a volume between two faces on the outside of the node. This allows a faster skipping of em- pty spaces during raytracing. Identical objects can access already calcula- ted linespaces, which can reduce the memory requirement by up to 94.13% and the initialization time of the datastructure by up to 97.15%. Due to the local access possibilities dynamic scenes can be visualized. An increase in quality can also be observed.