## Active zones in CSG for accelerating boundary evaluation, redundancy elimination, interference detection, and shading algorithms (1989)

### Cached

### Download Links

- [www.gvu.gatech.edu]
- [www.gvu.gatech.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | ACM Transactions on Graphics |

Citations: | 27 - 8 self |

### BibTeX

@ARTICLE{Rossignac89activezones,

author = {Jaroslaw R. Rossignac and Herbert B. Voelcker},

title = {Active zones in CSG for accelerating boundary evaluation, redundancy elimination, interference detection, and shading algorithms},

journal = {ACM Transactions on Graphics},

year = {1989},

volume = {8},

pages = {51--87}

}

### OpenURL

### Abstract

Solids defined by Boolean combinations of solid primitives may be represented in constructive solid geometry (CSG) as binary trees. Most CSG-based algorithms (e.g., for boundary evaluation, graphic shading, interference detection) do various forms of set-membership classification by traversing the tree associated with the solid. These algorithms usually generate intermediate results that do not contribute to the final result, and hence may be regarded as redundant and a source of inefficiency. To reduce such inefficiencies, we associate with each primitive A in a tree S an active zone 2 that represents the region of space where changes to A affect the solid represented by S, and we use a representation of 2 instead of S for set-membership classification. In the paper we develop a mathematical theory of active zones, prove that they correspond to the intersection of certain nodes of the original trees, and show how they lead to efficient new algorithms for boundary evaluation, for detecting and eliminating redundant nodes in CSG trees, for interference (null-set) detection, and for graphic shading.