Relations and transformations between quadtree encoding and switching function representation (Q1109513)

A nonhierarchical data structure for geometrical representation via switching functions in a grey coded space has been shown to provide some advantages over quadtree encoding, particularly for cross-sectioning and for symmetrical and oblong shapes. However, quadtree encoding is more effective for calculating integral properties. So transformations between the two representation methods can be useful. In this paper, the relations between quadtree encoding and switching function representation are developed, and transformation algorithms between the two data structures are derived. The resultant algorithms are very efficient and can be easily hardware implemented.