Guaranteed Occlusion and Visibility in Cluster Hierarchical Radiosity
Luc Leblanc
and Pierre Poulin
Proc. Eurographics Workshop on Rendering 2000, June 2000
Abstract
Visibility determination is the most expensive task in cluster hierarchical radiosity. Guaranteed full occlusion and full visibility can reduce these computations without causing visibility errors. We build a hierarchy of large convex occluders using face clustering. This structure is efficiently exploited to avoid computing visibility between mutually fully occluded scene elements. Used in conjunction with a full visibility culling method, we show improvements on several scenes.
Keywords
conservative visibility and occlusion, face clustering, shaft culling.
BibTeX entry
@inproceedings{LP-gi2000,
title = "Guaranteed Occlusion and Visibility in Cluster Hierarchical Radiosity",
author = "Luc Leblanc and Pierre Poulin",
booktitle = "Eurographics Workshop on Rendering 2000",
year = "2000",
month = "June",
pages = "89-100"
}
Online version
Adobe PDF version of the paper
Gzip PS version of the paper