Hierarchical Radiosity On Topological Data Structures
H. Bendels, Dieter W. Fellner, Stephan Schäfer · 1996
The use of topological data structures for polygon based approximation of 3D objects leads to great advantages in many computer graphics applications. Especially in algorithms for rendering or global illumination their use can yield better performance and more accurate solutions. We will show, how the Hierarchical Radiosity algorithm benefits from using topological data structures and how typical drawbacks of the classical quad-tree based approach can be avoided. Advantages of this method are better performance for complex scenes and an accurate Gouraud shading even for curved surfaces.