skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: All-Hex Meshing of Multiple-Region Domains without Cleanup.

Abstract

Abstract not provided.

Authors:
; ; ; ; ; ;
Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
1400055
Report Number(s):
SAND2016-10277C
648252
DOE Contract Number:
AC04-94AL85000
Resource Type:
Conference
Resource Relation:
Conference: Proposed for presentation at the 25th International Meshing Roundtable held September 27-30, 2016 in Washington, DC.
Country of Publication:
United States
Language:
English

Citation Formats

Ebeida, Mohamed Salah, Awad, Muhammad, Rushdi, Ahmad, Abbas, Misarah, Mitchell, Scott, Mahmoud, Ahmed, and Bajaj, Chandrajit. All-Hex Meshing of Multiple-Region Domains without Cleanup.. United States: N. p., 2016. Web.
Ebeida, Mohamed Salah, Awad, Muhammad, Rushdi, Ahmad, Abbas, Misarah, Mitchell, Scott, Mahmoud, Ahmed, & Bajaj, Chandrajit. All-Hex Meshing of Multiple-Region Domains without Cleanup.. United States.
Ebeida, Mohamed Salah, Awad, Muhammad, Rushdi, Ahmad, Abbas, Misarah, Mitchell, Scott, Mahmoud, Ahmed, and Bajaj, Chandrajit. Sat . "All-Hex Meshing of Multiple-Region Domains without Cleanup.". United States. doi:. https://www.osti.gov/servlets/purl/1400055.
@article{osti_1400055,
title = {All-Hex Meshing of Multiple-Region Domains without Cleanup.},
author = {Ebeida, Mohamed Salah and Awad, Muhammad and Rushdi, Ahmad and Abbas, Misarah and Mitchell, Scott and Mahmoud, Ahmed and Bajaj, Chandrajit},
abstractNote = {Abstract not provided.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Sat Oct 01 00:00:00 EDT 2016},
month = {Sat Oct 01 00:00:00 EDT 2016}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:
  • Here, we present an all-quad meshing algorithm for general domains. We start with a strongly balanced quadtree. In contrast to snapping the quadtree corners onto the geometric domain boundaries, we move them away from the geometry. Then we intersect the moved grid with the geometry. The resulting polygons are converted into quads with midpoint subdivision. Moving away avoids creating any flat angles, either at a quadtree corner or at a geometry–quadtree intersection. We are able to handle two-sided domains, and more complex topologies than prior methods. The algorithm is provably correct and robust in practice. It is cleanup-free, meaning wemore » have angle and edge length bounds without the use of any pillowing, swapping, or smoothing. Thus, our simple algorithm is fast and predictable. This paper has better quality bounds, and the algorithm is demonstrated over more complex domains, than our prior version.« less
  • No abstract prepared.
  • Abstract not provided.
  • Current hexahedral mesh generation techniques rely on a set of meshing tools, which when combined with geometry decomposition leads to an adequate mesh generation process. Of these tools, sweeping tends to be the workhorse algorithm, accounting for at least 50% of most meshing applications. Constraints which must be met for a volume to be sweepable are derived, and it is proven that these constraints are necessary but not sufficient conditions for sweepability. This paper also describes a new algorithm for detecting extruded or sweepable geometries. This algorithm, based on these constraints, uses topological and local geometric information, and is moremore » robust than feature recognition-based algorithms. A method for computing sweep dependencies in volume assemblies is also given. The auto sweep detect and sweep grouping algorithms have been used to reduce interactive user time required to generate all-hexahedral meshes by filtering out non-sweepable volumes needing further decomposition and by allowing concurrent meshing of independent sweep groups. Parts of the auto sweep detect algorithm have also been used to identify independent sweep paths, for use in volume-based interval assignment.« less