Premium
Hoops: 3D Curves as Conservative Occluders for Cell‐Visibility
Author(s) -
Brunet Pere,
Navazo Isabel,
Rossignac Jarek,
SaonaVázquez Carlos
Publication year - 2001
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/1467-8659.00536
Subject(s) - visibility , convexity , regular polygon , computer science , planar , construct (python library) , computer vision , mathematics , algorithm , computer graphics (images) , geometry , optics , physics , programming language , financial economics , economics
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.