File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Scopus: eid_2-s2.0-0025750925
- WOS: WOS:A1991FT45200014
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Volume discretization into tetrahedra-II. 3D triangulation by advancing front approach
Title | Volume discretization into tetrahedra-II. 3D triangulation by advancing front approach |
---|---|
Authors | |
Issue Date | 1991 |
Publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/compstruc |
Citation | Computers And Structures, 1991, v. 39 n. 5, p. 501-511 How to Cite? |
Abstract | Existing methods of automatic mesh generation for 3D solid objects are reviewed. Although the 3D Delaunay triangulation recently aroused much attention, its suitability as a finite element mesh generator is questioned. Although in 2D Delaunay triangulation, the 'max-min' angle criterion can be verified over the entire domain, no equivalent or similar criterion can be defined for its extension to 3D situations to ensure that tetrahedron elements so generated are well proportioned for numerical calculations. In this paper, a simple but versatile 3D triangulation scheme based on the advancing front technique for the discretization of arbitrary volumes is presented. To ensure that the tetrahedron elements generated are as equilateral as possible, the ratio of volume of the element to the sum of squares of edges put into a dimensionless form is adopted to judge the quality of a tetrahedron element. The quality of the finite element mesh can thus be ensured if the shape of each tetrahedron element is carefully controlled in the mesh construction process. Through the study of numerous examples of various characteristics, it is found that high-quality tetrahedron element meshes are obtained by the proposed algorithm. © 1991. |
Persistent Identifier | http://hdl.handle.net/10722/149956 |
ISSN | 2023 Impact Factor: 4.4 2023 SCImago Journal Rankings: 1.274 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lo, SH | en_US |
dc.date.accessioned | 2012-06-26T06:00:46Z | - |
dc.date.available | 2012-06-26T06:00:46Z | - |
dc.date.issued | 1991 | en_US |
dc.identifier.citation | Computers And Structures, 1991, v. 39 n. 5, p. 501-511 | en_US |
dc.identifier.issn | 0045-7949 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/149956 | - |
dc.description.abstract | Existing methods of automatic mesh generation for 3D solid objects are reviewed. Although the 3D Delaunay triangulation recently aroused much attention, its suitability as a finite element mesh generator is questioned. Although in 2D Delaunay triangulation, the 'max-min' angle criterion can be verified over the entire domain, no equivalent or similar criterion can be defined for its extension to 3D situations to ensure that tetrahedron elements so generated are well proportioned for numerical calculations. In this paper, a simple but versatile 3D triangulation scheme based on the advancing front technique for the discretization of arbitrary volumes is presented. To ensure that the tetrahedron elements generated are as equilateral as possible, the ratio of volume of the element to the sum of squares of edges put into a dimensionless form is adopted to judge the quality of a tetrahedron element. The quality of the finite element mesh can thus be ensured if the shape of each tetrahedron element is carefully controlled in the mesh construction process. Through the study of numerous examples of various characteristics, it is found that high-quality tetrahedron element meshes are obtained by the proposed algorithm. © 1991. | en_US |
dc.language | eng | en_US |
dc.publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/compstruc | en_US |
dc.relation.ispartof | Computers and Structures | en_US |
dc.title | Volume discretization into tetrahedra-II. 3D triangulation by advancing front approach | en_US |
dc.type | Article | en_US |
dc.identifier.email | Lo, SH:hreclsh@hkucc.hku.hk | en_US |
dc.identifier.authority | Lo, SH=rp00223 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.scopus | eid_2-s2.0-0025750925 | en_US |
dc.identifier.hkuros | 42426 | - |
dc.identifier.volume | 39 | en_US |
dc.identifier.issue | 5 | en_US |
dc.identifier.spage | 501 | en_US |
dc.identifier.epage | 511 | en_US |
dc.identifier.isi | WOS:A1991FT45200014 | - |
dc.publisher.place | United Kingdom | en_US |
dc.identifier.scopusauthorid | Lo, SH=7401542444 | en_US |
dc.identifier.issnl | 0045-7949 | - |