Solid/solid classification operations for recursive spatial decomposition and domain triangulation of solid models

Abstract Correct solid/solid classification operations are necessary for fully automatic discretization of solid models. The paper addresses this classification problem in the context of recursive spatial decomposition and domain triangulation. While, in the former case, solid/solid classification must be strictly based on the intersection operation, in the latter, a topological approach based on neighborhood information transfer is required.

[1]  Mark S. Shephard,et al.  Automatic three‐dimensional mesh generation by the finite octree technique , 1984 .

[2]  Hanan Samet,et al.  Hierarchical data structures and algorithms for computer graphics. II. Applications , 1988, IEEE Computer Graphics and Applications.

[3]  William H. Frey,et al.  An apporach to automatic three‐dimensional finite element mesh generation , 1985 .

[4]  Pere Brunet,et al.  Extended octtree representation of free form surfaces , 1987, Comput. Aided Geom. Des..

[5]  H. Voelcker,et al.  Solid modeling: current status and research directions , 1983, IEEE Computer Graphics and Applications.

[6]  M. Shephard,et al.  Geometry-based fully automatic mesh generation and the delaunay triangulation , 1988 .

[7]  Nickolas S. Sapidis,et al.  Advanced techniques for automatic finite element meshing from solid models , 1989 .

[8]  A.A.G. Requicha,et al.  Boolean operations in solid modeling: Boundary evaluation and merging algorithms , 1985, Proceedings of the IEEE.

[9]  K. R. Grice,et al.  Robust, geometrically based, automatic two‐dimensional mesh generation , 1987 .

[10]  Christoph M. Hoffmann,et al.  Geometric and Solid Modeling , 1989 .

[11]  Mukul Saxena,et al.  Automatic mesh generation from solid models based on recursive spatial decompositions , 1989 .

[12]  Nickolas S. Sapidis,et al.  Domain Delaunay Tetrahedrization of arbitrarily shaped curved polyhedra defined in a solid modeling system , 1991, SMA '91.

[13]  Robert B. Tilove,et al.  Set Membership Classification: A Unified Approach to Geometric Intersection Problems , 1980, IEEE Transactions on Computers.

[14]  John Woodwark.  Generating wireframes from set-theoretic solid models by spatial division , 1986 .

[15]  Hanan Samet,et al.  Hierarchical data structures and algorithms for computer graphics. I. Fundamentals , 1988, IEEE Computer Graphics and Applications.

[16]  Nickolas S. Sapidis.  Domain Delaunay tetrahedrization of curved polyhedra defined in a solid modeling system , 1993 .

[17]  Ajay Kela.  Hierarchical octree approximations for boundary representation-based geometric models , 1989 .

[18]  D. A. Field,et al.  Implementing Watson's algorithm in three dimensions , 1986, SCG '86.

[19]  Nickolas S. Sapidis,et al.  Domain Delaunay tetrahedrization of solid models , 1991, Int. J. Comput. Geom. Appl..

[20]  Nickolas S. Sapidis,et al.  Delaunay triangulation of arbitrarily shaped planar domains , 1991, Comput. Aided Geom. Des..