Guaranteed Occlusion and Visibility in Cluster Hierarchical Radiosity

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.

• Type: Conference
• Year: 2000
• Where: RT
• Authors: Luc Leblanc, Pierre Poulin
• Keywords: Computer Graphics, RT 2000, Visibility, Visibility Determination, Visibility Errors