CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Occlusion Culling and Z-fail for Soft Shadow Volume Algorithms

Ulf Assarsson (Institutionen för datorteknik, Real-time Computer Graphics) ; Tomas Akenine-Möller (Institutionen för datorteknik, Real-time Computer Graphics)
The Visual Computer Vol. 20 (2004), 8-9,
[Artikel, refereegranskad vetenskaplig]

This paper presents a significant improvement of our previously proposed soft shadow volume algorithm for simulating soft shadows. By restructuring the algorithm, we can considerably simplify the computations, introduce efficient occlusion culling with speedups of 3-4 times, thus approaching real-time performance. We can also generalize the algorithm to produce correct shadows even when the eye is inside a shadowed region (using z-fail). We present and evaluate a three pass implementation of the restructured algorithm for near real-time rendering of soft shadows on a computer with a commodity graphics accelerator. However, preferably the rendering of the wedges should be implemented in hardware, and for this we suggest and evaluate a single pass algorithm.

Nyckelord: soft shadows; graphics hardware; shadow volumes

Denna post skapades 2006-09-19. Senast ändrad 2017-10-03.
CPL Pubid: 12227


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för datorteknik, Real-time Computer Graphics (2002-2004)


Datavetenskap (datalogi)

Chalmers infrastruktur