Mora, FrédéricGerhards, JulienAveneau, LilianGhazanfarpour, DjamchidElmar Eisemann and Eugene Fiume2016-06-172016-06-172016978-3-03868-019-21727-3463https://doi.org/10.2312/sre.20161212Computing accurate hard shadows is a difficult problem in interactive rendering. Previous methods rely either on Shadow Maps or Shadow Volumes. Recently Partitioned Shadow Volumes (PSV) has been introduced. It revisits the old Shadow Volumes Binary Tree Space Partitioning algorithm, leading to a practicable and efficient technique. In this article, we analyze the PSV query algorithm and identify two main drawbacks: First, it uses a stack which is not GPU friendly; its size must be small enough to reduce the register pressure, but large enough to avoid stack overflow. Second, PSV struggles with configurations involving significant depth complexity, especially for lit points. We solve these problems by adding a depth information to the PSV data structure, and by designing a stackless query. In addition, we show how to combine the former PSV query with our stackless solution, leading to a hybrid technique taking advantage of both. This eliminates any risk of stack overflow, and our experiments demonstrate that these improvements accelerate the rendering time up to a factor of 3.I.3.7 [Computer Graphics]Three Dimensional Graphics and RealismColorshadingshadowingand texture10.2312/sre.2016121273-83