Robust and efficient Cartesian mesh generation for component-based geometry. Aftosmis, M., J., Berger, M., J., & Melton, J., E. AIAA Journal, 36(6):952-960, American Institute of Aeronautics and Astronautics Inc., 5, 1998.
![Robust and efficient Cartesian mesh generation for component-based geometry [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Paper doi abstract bibtex
Paper doi abstract bibtex This work documents a new method for rapid and robust Cartesian mesh generation for component-based geometry. The new algorithm adopts a novel strategy that 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 automatically and consistently handles geometric degeneracies with an algorithmic tie-breaking routine. The intersection procedure has worst-case computational complexity of O(N log N) 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 triangulation 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 that are well aligned with local geometry. The mesh generation scheme has linear asymptotic complexity with memory requirements that total approximately 14-17 words/cell. The mesh generation speed is approximately 106 cells/minute on a typical engineering workstation.
@article{
title = {Robust and efficient Cartesian mesh generation for component-based geometry},
type = {article},
year = {1998},
keywords = {Computer Aided Design,Computing,Fuselages,Hardware Development,Helicopters,High Aspect Ratio,High Speed Civil Transport,Institute of Electrical and Electronics Engineers,Mesh Generation,Recursive Algorithm},
pages = {952-960},
volume = {36},
month = {5},
publisher = {American Institute of Aeronautics and Astronautics Inc.},
day = {17},
id = {35e8e453-e1e3-34f6-af89-0240163419b7},
created = {2021-02-17T23:17:25.999Z},
accessed = {2021-02-17},
file_attached = {true},
profile_id = {6476e386-2170-33cc-8f65-4c12ee0052f0},
group_id = {5a9f751c-3662-3c8e-b55d-a8b85890ce20},
last_modified = {2021-02-17T23:19:31.039Z},
read = {false},
starred = {false},
authored = {false},
confirmed = {false},
hidden = {false},
citation_key = {aftosmis:aj:1998},
private_publication = {false},
abstract = {This work documents a new method for rapid and robust Cartesian mesh generation for component-based geometry. The new algorithm adopts a novel strategy that 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 automatically and consistently handles geometric degeneracies with an algorithmic tie-breaking routine. The intersection procedure has worst-case computational complexity of O(N log N) 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 triangulation 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 that are well aligned with local geometry. The mesh generation scheme has linear asymptotic complexity with memory requirements that total approximately 14-17 words/cell. The mesh generation speed is approximately 106 cells/minute on a typical engineering workstation.},
bibtype = {article},
author = {Aftosmis, M. J. and Berger, M. J. and Melton, J. E.},
doi = {10.2514/2.464},
journal = {AIAA Journal},
number = {6}
}Downloads: 0
{"_id":"CddM6RkTAAsbnD4aZ","bibbaseid":"aftosmis-berger-melton-robustandefficientcartesianmeshgenerationforcomponentbasedgeometry-1998","author_short":["Aftosmis, M., J.","Berger, M., J.","Melton, J., E."],"bibdata":{"title":"Robust and efficient Cartesian mesh generation for component-based geometry","type":"article","year":"1998","keywords":"Computer Aided Design,Computing,Fuselages,Hardware Development,Helicopters,High Aspect Ratio,High Speed Civil Transport,Institute of Electrical and Electronics Engineers,Mesh Generation,Recursive Algorithm","pages":"952-960","volume":"36","month":"5","publisher":"American Institute of Aeronautics and Astronautics Inc.","day":"17","id":"35e8e453-e1e3-34f6-af89-0240163419b7","created":"2021-02-17T23:17:25.999Z","accessed":"2021-02-17","file_attached":"true","profile_id":"6476e386-2170-33cc-8f65-4c12ee0052f0","group_id":"5a9f751c-3662-3c8e-b55d-a8b85890ce20","last_modified":"2021-02-17T23:19:31.039Z","read":false,"starred":false,"authored":false,"confirmed":false,"hidden":false,"citation_key":"aftosmis:aj:1998","private_publication":false,"abstract":"This work documents a new method for rapid and robust Cartesian mesh generation for component-based geometry. The new algorithm adopts a novel strategy that 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 automatically and consistently handles geometric degeneracies with an algorithmic tie-breaking routine. The intersection procedure has worst-case computational complexity of O(N log N) 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 triangulation 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 that are well aligned with local geometry. The mesh generation scheme has linear asymptotic complexity with memory requirements that total approximately 14-17 words/cell. The mesh generation speed is approximately 106 cells/minute on a typical engineering workstation.","bibtype":"article","author":"Aftosmis, M. J. and Berger, M. J. and Melton, J. E.","doi":"10.2514/2.464","journal":"AIAA Journal","number":"6","bibtex":"@article{\n title = {Robust and efficient Cartesian mesh generation for component-based geometry},\n type = {article},\n year = {1998},\n keywords = {Computer Aided Design,Computing,Fuselages,Hardware Development,Helicopters,High Aspect Ratio,High Speed Civil Transport,Institute of Electrical and Electronics Engineers,Mesh Generation,Recursive Algorithm},\n pages = {952-960},\n volume = {36},\n month = {5},\n publisher = {American Institute of Aeronautics and Astronautics Inc.},\n day = {17},\n id = {35e8e453-e1e3-34f6-af89-0240163419b7},\n created = {2021-02-17T23:17:25.999Z},\n accessed = {2021-02-17},\n file_attached = {true},\n profile_id = {6476e386-2170-33cc-8f65-4c12ee0052f0},\n group_id = {5a9f751c-3662-3c8e-b55d-a8b85890ce20},\n last_modified = {2021-02-17T23:19:31.039Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {false},\n hidden = {false},\n citation_key = {aftosmis:aj:1998},\n private_publication = {false},\n abstract = {This work documents a new method for rapid and robust Cartesian mesh generation for component-based geometry. The new algorithm adopts a novel strategy that 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 automatically and consistently handles geometric degeneracies with an algorithmic tie-breaking routine. The intersection procedure has worst-case computational complexity of O(N log N) 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 triangulation 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 that are well aligned with local geometry. The mesh generation scheme has linear asymptotic complexity with memory requirements that total approximately 14-17 words/cell. The mesh generation speed is approximately 106 cells/minute on a typical engineering workstation.},\n bibtype = {article},\n author = {Aftosmis, M. J. and Berger, M. J. and Melton, J. E.},\n doi = {10.2514/2.464},\n journal = {AIAA Journal},\n number = {6}\n}","author_short":["Aftosmis, M., J.","Berger, M., J.","Melton, J., E."],"urls":{"Paper":"https://bibbase.org/service/mendeley/6476e386-2170-33cc-8f65-4c12ee0052f0/file/0cc00f55-5f02-c0b5-2921-d839fe2c8e1c/Aftosmis_Berger_Melton___1998___Robust_and_efficient_Cartesian_mesh_generation_for_component_based_geometry.pdf.pdf"},"biburl":"https://bibbase.org/service/mendeley/6476e386-2170-33cc-8f65-4c12ee0052f0","bibbaseid":"aftosmis-berger-melton-robustandefficientcartesianmeshgenerationforcomponentbasedgeometry-1998","role":"author","keyword":["Computer Aided Design","Computing","Fuselages","Hardware Development","Helicopters","High Aspect Ratio","High Speed Civil Transport","Institute of Electrical and Electronics Engineers","Mesh Generation","Recursive Algorithm"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://bibbase.org/service/mendeley/6476e386-2170-33cc-8f65-4c12ee0052f0","dataSources":["qwkM8ZucCwtxbnXfc"],"keywords":["computer aided design","computing","fuselages","hardware development","helicopters","high aspect ratio","high speed civil transport","institute of electrical and electronics engineers","mesh generation","recursive algorithm"],"search_terms":["robust","efficient","cartesian","mesh","generation","component","based","geometry","aftosmis","berger","melton"],"title":"Robust and efficient Cartesian mesh generation for component-based geometry","year":1998}