Sciweavers

TOG
2002

Robust epsilon visibility

13 years 4 months ago
Robust epsilon visibility
Analytic visibility algorithms, for example methods which compute a subdivided mesh to represent shadows, are notoriously unrobust and hard to use in practice. We present a new method based on a generalized definition of extremal stabbing lines, which are the extremities of shadow boundaries. We treat scenes containing multiple edges or vertices in degenerate configurations, (e.g., collinear or coplanar). We introduce a robust method to determine whether each generalized extremal stabbing line is blocked, or is touched by these scene elements, and thus added to the line's generators. We develop robust blocker predicates for polygons which are smaller than . For larger values, small shadow features merge and eventually disappear. We can thus robustly connect generalized extremal stabbing lines in degenerate scenes to form shadow boundaries. We show that our approach is consistent, and that shadow boundary connectivity is preserved when features merge. We have implemented our alg...
Florent Duguet, George Drettakis
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where TOG
Authors Florent Duguet, George Drettakis
Comments (0)