Relations and transformations between quadtree encoding and switching function representation

DOI10.1016/0010-4485(87)90265-XMaRDI QIDQ1109513zbMATH OpenFDO

Authors Moshe Shpitalni

Publication date 1987

Published in CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0010-4485(87)90265-X

zbMATH Keywords

algorithmscomputer technologycomputer-aided designquadtreesswitching function representation

Mathematics Subject Classification ID

Descriptive geometry (51N05) Algorithms for approximation of functions (65D15)

Review text

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.

Recommendations

• Coding of geometric configurations using quadtrees
• Planar decomposition for quadtree data structure
• Efficient Coding of Quadtree Nodes
• Finite element mesh generation via switching function representation
• Variant code transformations for linear quadtrees

This page was built for publication: Relations and transformations between quadtree encoding and switching function representation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109513)