Robust and efficient cartesian mesh generation for component-based geometry

M. J. Aftosmis, Marsha Berger, J. E. Melton

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This work documents a new method for rapid and robust Cartesian mesh generation for componentbased geometry. The new algorithm adopts a novel strategy which first intersects the components to extract the wetted surface before proceeding with volume mesh generation in a second phase. The intersection scheme is based on a robust geometry engine that uses adaptive precision arithmetic and which automatically and consistently handles geometric degeneracies with an algorithmic tie-breaTdng routine. The intersection procedure has worse case computational complexity of O(N logN) and is demonstrated on test cases with up to 121 overlapping and intersecting components including a variety of geometric degeneracies. The volume mesh generation takes the intersected surface triangulatipn as input and generates the mesh through cell division of an initially uniform coarse grid. In refining hexagonal cells to resolve the geometry, the new approach preserves the ability to directionally divide cells which are well-aligned with local geometry. The mesh generation scheme has linear asymptotic complexity with memory requirements that total approximately 14 words/cell. The mesh generation speed is approximately 106 cells/minute on a 195Mhz RISC R10000 workstation.

Original languageEnglish (US)
Title of host publication35th Aerospace Sciences Meeting and Exhibit
PublisherAmerican Institute of Aeronautics and Astronautics Inc, AIAA
StatePublished - 1997
Event35th Aerospace Sciences Meeting and Exhibit, 1997 - Reno, United States
Duration: Jan 6 1997Jan 9 1997

Other

Other35th Aerospace Sciences Meeting and Exhibit, 1997
CountryUnited States
CityReno
Period1/6/971/9/97

Fingerprint

Mesh generation
geometry
Geometry
intersections
cells
hexagonal cells
cell division
Reduced instruction set computing
Computer workstations
workstations
refining
engine
Refining
engines
mesh
Computational complexity
grids
Cells
Engines
Data storage equipment

ASJC Scopus subject areas

  • Space and Planetary Science
  • Aerospace Engineering

Cite this

Aftosmis, M. J., Berger, M., & Melton, J. E. (1997). Robust and efficient cartesian mesh generation for component-based geometry. In 35th Aerospace Sciences Meeting and Exhibit [AIAA Paper 97-0196] American Institute of Aeronautics and Astronautics Inc, AIAA.

Robust and efficient cartesian mesh generation for component-based geometry. / Aftosmis, M. J.; Berger, Marsha; Melton, J. E.

35th Aerospace Sciences Meeting and Exhibit. American Institute of Aeronautics and Astronautics Inc, AIAA, 1997. AIAA Paper 97-0196.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Aftosmis, MJ, Berger, M & Melton, JE 1997, Robust and efficient cartesian mesh generation for component-based geometry. in 35th Aerospace Sciences Meeting and Exhibit., AIAA Paper 97-0196, American Institute of Aeronautics and Astronautics Inc, AIAA, 35th Aerospace Sciences Meeting and Exhibit, 1997, Reno, United States, 1/6/97.
Aftosmis MJ, Berger M, Melton JE. Robust and efficient cartesian mesh generation for component-based geometry. In 35th Aerospace Sciences Meeting and Exhibit. American Institute of Aeronautics and Astronautics Inc, AIAA. 1997. AIAA Paper 97-0196
Aftosmis, M. J. ; Berger, Marsha ; Melton, J. E. / Robust and efficient cartesian mesh generation for component-based geometry. 35th Aerospace Sciences Meeting and Exhibit. American Institute of Aeronautics and Astronautics Inc, AIAA, 1997.
@inproceedings{37e6267871284afaa42eca707a0055ce,
title = "Robust and efficient cartesian mesh generation for component-based geometry",
abstract = "This work documents a new method for rapid and robust Cartesian mesh generation for componentbased geometry. The new algorithm adopts a novel strategy which first intersects the components to extract the wetted surface before proceeding with volume mesh generation in a second phase. The intersection scheme is based on a robust geometry engine that uses adaptive precision arithmetic and which automatically and consistently handles geometric degeneracies with an algorithmic tie-breaTdng routine. The intersection procedure has worse case computational complexity of O(N logN) and is demonstrated on test cases with up to 121 overlapping and intersecting components including a variety of geometric degeneracies. The volume mesh generation takes the intersected surface triangulatipn as input and generates the mesh through cell division of an initially uniform coarse grid. In refining hexagonal cells to resolve the geometry, the new approach preserves the ability to directionally divide cells which are well-aligned with local geometry. The mesh generation scheme has linear asymptotic complexity with memory requirements that total approximately 14 words/cell. The mesh generation speed is approximately 106 cells/minute on a 195Mhz RISC R10000 workstation.",
author = "Aftosmis, {M. J.} and Marsha Berger and Melton, {J. E.}",
year = "1997",
language = "English (US)",
booktitle = "35th Aerospace Sciences Meeting and Exhibit",
publisher = "American Institute of Aeronautics and Astronautics Inc, AIAA",

}

TY - GEN

T1 - Robust and efficient cartesian mesh generation for component-based geometry

AU - Aftosmis, M. J.

AU - Berger, Marsha

AU - Melton, J. E.

PY - 1997

Y1 - 1997

N2 - This work documents a new method for rapid and robust Cartesian mesh generation for componentbased geometry. The new algorithm adopts a novel strategy which first intersects the components to extract the wetted surface before proceeding with volume mesh generation in a second phase. The intersection scheme is based on a robust geometry engine that uses adaptive precision arithmetic and which automatically and consistently handles geometric degeneracies with an algorithmic tie-breaTdng routine. The intersection procedure has worse case computational complexity of O(N logN) and is demonstrated on test cases with up to 121 overlapping and intersecting components including a variety of geometric degeneracies. The volume mesh generation takes the intersected surface triangulatipn as input and generates the mesh through cell division of an initially uniform coarse grid. In refining hexagonal cells to resolve the geometry, the new approach preserves the ability to directionally divide cells which are well-aligned with local geometry. The mesh generation scheme has linear asymptotic complexity with memory requirements that total approximately 14 words/cell. The mesh generation speed is approximately 106 cells/minute on a 195Mhz RISC R10000 workstation.

AB - This work documents a new method for rapid and robust Cartesian mesh generation for componentbased geometry. The new algorithm adopts a novel strategy which first intersects the components to extract the wetted surface before proceeding with volume mesh generation in a second phase. The intersection scheme is based on a robust geometry engine that uses adaptive precision arithmetic and which automatically and consistently handles geometric degeneracies with an algorithmic tie-breaTdng routine. The intersection procedure has worse case computational complexity of O(N logN) and is demonstrated on test cases with up to 121 overlapping and intersecting components including a variety of geometric degeneracies. The volume mesh generation takes the intersected surface triangulatipn as input and generates the mesh through cell division of an initially uniform coarse grid. In refining hexagonal cells to resolve the geometry, the new approach preserves the ability to directionally divide cells which are well-aligned with local geometry. The mesh generation scheme has linear asymptotic complexity with memory requirements that total approximately 14 words/cell. The mesh generation speed is approximately 106 cells/minute on a 195Mhz RISC R10000 workstation.

UR - http://www.scopus.com/inward/record.url?scp=84983165295&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84983165295&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84983165295

BT - 35th Aerospace Sciences Meeting and Exhibit

PB - American Institute of Aeronautics and Astronautics Inc, AIAA

ER -