z-logo
Premium
Partitioned Shadow Volumes
Author(s) -
Gerhards J.,
Mora F.,
Aveneau L.,
Ghazanfarpour D.
Publication year - 2015
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.12583
Subject(s) - computer science , shadow mapping , robustness (evolution) , memory footprint , partition (number theory) , shadow (psychology) , polygon (computer graphics) , computer graphics (images) , graphics , algorithm , artificial intelligence , mathematics , psychology , telecommunications , biochemistry , chemistry , combinatorics , frame (networking) , psychotherapist , gene , operating system
Real‐time shadows remain a challenging problem in computer graphics. In this context, shadow algorithms generally rely either on shadow mapping or shadow volumes. This paper rediscovers an old class of algorithms that build a binary space partition over the shadow volumes. For almost 20 years, such methods have received little attention as they have been considered lacking of both robustness and efficiency. We show that these issues can be overcome, leading to a simple and robust shadow algorithm. Hence we demonstrate that this kind of approach can reach a high level of performance. Our algorithm uses a new partitioning strategy which avoids any polygon clipping. It relies on a Ternary Object Partitioning tree, a new data structure used to find if an image point is shadowed. Our method works on a triangle soup and its memory footprint is fixed. Our experiments show that it is efficient and robust, including for finely tessellated models.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here