The problem of converting boundary representation (B-rep) to constructive solid geometry representation (CSG-rep) (and vice versa) is discussed in two phases. The first phase entails finding a CSG-rep that defines the region bounded by a polygonal profile curve. The second phase utilizes the results of the first phase to find a CSG-rep for many non-polygonal profile curves. A mathematically concise representation of a region bounded by a polygonal is presented. Namely, any polygonal region bounded by an n sided polygon may be represented by a binary tree which has at most n planar halfspaces as leaves. A structure for this representation and an algorithm for calculating is discussed
