Comparison of Accelerating Techniques for Discontinuity Meshing

Warning

This publication doesn't include Faculty of Economics and Administration. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

NECHVÍLE Karel TOBOLA Petr SOCHOR Jiří

Year of publication 2003
Type Article in Proceedings
Conference WSCG'2003 Short papers
MU Faculty or unit

Faculty of Informatics

Citation
Field Informatics
Keywords discontinuity meshing; accelerating strategies; discontinuity surface propagation; bounding volume hierarchies
Description Creating an appropriate mesh is one of demanding tasks of many global illumination algorithms. Discontinuity meshing proved to diminish artifacts caused by other meshing strategies. Since naive discontinuity meshing would produce a great amount of geometric computations, accelerating techniques are usually involved. In this paper, we present results obtained with help of k-discrete orientation polytopes (k-DOPs) and oriented bounding boxes (OBBs) and compare them to previously used accelerating schemes like voxels, BSP-trees and octrees.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.