Hexahedral meshing of non-linear volumes using Voronoi faces and edges

This work extends an algorithm presented in our recent paper [1] for automatic hexahedral meshing, based on the embedded Voronoi graph (EVG). The embedded Voronoi graph contains the full symbolic information of the Voronoi diagram and the medial axis of the object, and a geometric approximation to the real geometry. The EVG is used for decomposing the object, into simple sub-volumes meshable by basic meshing techniques. The EVG provides complete information regarding proximity and adjacency relationships between the entities of the volume. Hence, decomposition faces are determined unambiguously, without any further geometric computations and the resulting sub-volumes are guaranteed to be well-defined and disjoint. The decomposition algorithm is applicable to any volume, including volumes with degenerate medial axis. The previous paper defined the decomposition based on sub-volumes sweepable perpendicular to an EVG face. This work extends the decomposition to handle all types of EVG entities, providing a complete decomposition of the volume. It analyses the types of sub-volumes that are generated and the meshing techniques applicable to them. keywords: hexahedra; mesh generation; medial axis; Voronoi diagram; embedded Voronoi graph; decomposition

[1]  David Eppstein,et al.  Provably good mesh generation , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[2]  Alla Sheffer,et al.  Virtual Topology Operators for Meshing , 2000, Int. J. Comput. Geom. Appl..

[3]  Timothy J. Tautges,et al.  THE WHISKER WEAVING ALGORITHM: A CONNECTIVITY‐BASED METHOD FOR CONSTRUCTING ALL‐HEXAHEDRAL FINITE ELEMENT MESHES , 1996 .

[4]  T. Blacker.  The Cooper Tool , 1996 .

[5]  P. George.  Improvements on Delaunay-based three-dimensional automatic mesh generator , 1997 .

[6]  Shang-Sheng Liu,et al.  Automatic Hexahedral Mesh Generation by Recursive Convex and Swept Volume Decomposition , 1997 .

[7]  Cecil Armstrong,et al.  Hexahedral meshing using midpoint subdivision and integer programming. , 1995 .

[8]  David R. White,et al.  Automated Hexahedral Mesh Generation by Virtual Decomposition , 1995 .

[9]  Damian J. Sheehy,et al.  Computing the medial surface of a solid from a domain Delaunay triangulation , 1995, Symposium on Solid Modeling and Applications.

[10]  Houman Borouchaki,et al.  Delaunay Tetrahedralization using an Advancing-Front Approach , 1996 .

[11]  Alla Sheffer,et al.  Hexahedral Mesh Generation using the Embedded Voronoi Graph , 1999, Engineering with Computers.

[12]  Alla Sheffer,et al.  Hexahedral Mesh Generation Using Voronoi Skeletons , 1998, IMR.

[13]  Steven J. Owen,et al.  A Survey of Unstructured Mesh Generation Technology , 1998, IMR.

[14]  N. Weatherill,et al.  Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints , 1994 .

[15]  M. Sabin,et al.  Hexahedral mesh generation by medial surface subdivision: Part I. Solids with convex edges , 1995 .

[16]  Scott A. Mitchell,et al.  High Fidelity Interval Assignment , 2000, Int. J. Comput. Geom. Appl..

[17]  Ari Rappoport,et al.  Computing the Voronoi diagram of a 3-D polyhedron by separate computation of its symbolic and geometric parts , 1999, SMA '99.

[18]  M. Price,et al.  Hexahedral Mesh Generation by Medial Surface Subdivision: Part II. Solids with Flat and Concave Edges , 1997 .