Hoops: 3D Curves as Conservative Occluders for Cell-Visibility
No Thumbnail Available
Date
2001
Journal Title
Journal ISSN
Volume Title
Publisher
Blackwell Publishers Ltd and the Eurographics Association
Abstract
Most visibility culling algorithms require convexity of occluders. Occluder synthesis algorithms attempt to construct large convex occluders inside bulky non-convex sets. Occluder fusion algorithms generate convex occluders that are contained in the umbra cast by a group of objects given an area light. In this paper we prove that convexity requirements can be shifted from the occluders to their umbra with no loss of efficiency, and use this property to show how some special non-planar, non-convex closed polylines that we call "hoops" can be used to compute occlusion efficiently for objects that have no large interior convex sets and were thus rejected by previous approaches.
Description
@article{10.1111:1467-8659.00536,
journal = {Computer Graphics Forum},
title = {{Hoops: 3D Curves as Conservative Occluders for Cell-Visibility}},
author = {Brunet, Pere and Navazo, Isabel and Rossignac, Jarek and Saona-Vazquez, Carlos},
year = {2001},
publisher = {Blackwell Publishers Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/1467-8659.00536}
}