All-Hex Meshing of Multiple-Region Domains without Cleanup
Awad, Muhammad, Ahmad Rushdi, Misarah Abbas, Scott Mitchell, Ahmad Hassan, Chandrajit Bajaj, Mohamed Ebeida
Proceedings, 25th International Meshing Roundtable, Elsevier, Science Direct, September 26-30 2016
25th International Meshing Roundtable
Washington DC, U.S.A.
September 26-30, 2016
Muhammad Awad, Alexandria University, EG,
Ahmad Rushdi, University of Texas, Austin, US, email@example.com
Misarah Abbas, Alexandria University, EG,
Scott Mitchell, Sandia National Laboratories, US,
Ahmad Hassan, University of California, Davis, US,
Chandrajit Bajaj, University of Texas, Austin, US,
Mohamed Ebeida, Sandia National Laboratories, US, firstname.lastname@example.org
In this paper, we present a new algorithm for all-hex meshing of domains with multiple regions without no post-processing cleanup. Our method starts with a strongly balanced octree. In contrast to snapping the grid points onto the geometric boundaries, we move points a slight distance away from the common boundaries. Then we intersect the moved grid with the geometry. This allows us to avoid creating any flat angles, and we are able to handle two-sided regions and more complex topologies than prior methods. The algorithm is robust and cleanup-free; without the use of any pillowing, swapping, or smoothing. Thus, our simple algorithm is also more predictable than prior art.
Download Full Paper (PDF)
Contact author(s) or publisher for availability and copyright information on above referenced article