One More Trick with Planes
We can develop a visibility alogorthim based on evaluating plane equations.
Consider the complement argument of the viewpoint culling alogrithm.
Any facet that contains the eye point within its negative half-space is invisible.
Any facet that contains the eye point within its positive half-space is visible.
Well almost... it would work if there were no overlapping facets.
However, notice how the overlapping facets partition each other.
Suppose we build a tree of these partitions.
|
|
