 Constructive solid geometry tree

A rooted tree whose leaves describe primitive regions and whose internal nodes describe Boolean operations. A half-space leaf can hold an implicit equation and an inside-sign convention. Evaluate membership from the leaves toward the root; interval arithmetic can propagate conservative inside/outside bounds over a box instead of a single point.