Finite octree meshing through topologically driven geometric operators
Kurt R. Grice
Abstract
Open-access reader
Kurt R. Grice
Abstract
Open-access reader
The octree technique is developed into the finite octree, and an overview is given. Modeler requirements are given. The octree discretization is discussed along with geometric communication operators. Geometric communication operators returning topological associativity and geometric communication operators returning spatial data are also discussed and illustrated. The advantages are given of the boundary representation and of geometric communication operators. The implementation plays an important role in the integration with a variety of geometric modelers. The capabilities of closed loop processes within a complete finite element system are presented.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The octree technique is developed into the finite octree, and an overview is given. Modeler requirements are given. The octree discretization is discussed along with geometric communication operators. Geometric communication operators returning topological associativity and geometric communication operators returning spatial data are also discussed and illustrated. The advantages are given of the boundary representation and of geometric communication operators. The implementation plays an important role in the integration with a variety of geometric modelers. The capabilities of closed loop processes within a complete finite element system are presented.
Key concepts: Octree, Boundary representation, Representation (politics), Computer science, Geometric modeling, Boundary (topology), Variety (cybernetics), Finite element method