Guaranteed Occlusion and Visibility in Cluster Hierarchical Radiosity
Luc Leblanc, Pierre Poulin
, June 2000, pp. 89--100.
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.
Keyword(s): conservative visibility, occlusion, face clustering, shaft culling
@inproceedings{Leblanc:2000:GOA,
author = {Luc Leblanc and Pierre Poulin},
title = {Guaranteed Occlusion and Visibility in Cluster Hierarchical Radiosity},
booktitle = {},
pages = {89--100},
month = jun,
year = {2000},
}
Return to the search page.
graphbib: Powered by "bibsql" and "SQLite3."