Towards Automatic Grid Generation using Binary Space Partition Trees
George Vaněček · 1990
The problem of discretizing three-dimensional solid objects is considered. The objects may be presented in standard boundary representation. We discuss constructing from this representation a binary space partition tree, a data structure especially well-suited to the geometric processing needed for grid generation. We also give algorithms for generating fixed-mesh grids and variable-mesh grids adaptively. The method has been implemented on top of a solid modeling system. Key Words: Algorithms, three dimensions, rectangular grid, solid modeling. AMS (MOS) subject classifications: 65M50, 65N50, 68P05, 68U05. 1 This work has been supported in part by NSF Grant CCR-86-19817. Towards Grid Generation with BSP Trees 1 1 Introduction Solid modeling techniques are applied in mechanical simulation system for representing objects and detecting collisions in dynamic simulation systems [2, 10, 11, 26], and they are also applied in systems for solving partial differential equations (PDE) to rep...