Graphics Reference
In-Depth Information
Prove that a set
X
Õ
R
n
is a Nef polyhedron if and only if it is the realization of a CSG-
tree based on closed linear halfplanes and the set operations of ordinary union, inter-
section and difference. Because of this fact and other reasons, it has been argued that
Nef polyhedra are an attractive primitive for CSG and geometric modeling in general.
See [Bier95].
