QUALITY MESH GENERATION IN HIGHER DIMENSIONS.
Saved in:
| Title: | QUALITY MESH GENERATION IN HIGHER DIMENSIONS. |
|---|---|
| Authors: | Mitchell, Scott A.1 samitch@sandia.gov, Vavasis, Stephen A.2 vavasis@cs.cornell.edu |
| Source: | SIAM Journal on Computing. 2000, Vol. 29 Issue 4, p1334. 37p. |
| Subjects: | Numerical grid generation (Numerical analysis), ALGOL (Computer program language), C++, Finite element method data processing |
| Abstract: | We consider the problem of triangulating a d-dimensional region. Our mesh generation algorithm, called QMG, is a quadtree-based algorithm that can triangulate any polyhedral region including non-convex regions with holes. Furthermore, our algorithm guarantees a bounded aspect ratio triangulation provided that the input domain itself has no sharp angles. Finally, our algorithm is guaranteed never to over-refine the domain, in the sense that the number of simplices produced by QMG is bounded above by a factor times the number produced by any competing algorithm, where the factor depends on the aspect ratio bound satisfied by the competing algorithm. The QMG algorithm has been implemented in C++ and is used as a mesh generator for the finite element method. [ABSTRACT FROM AUTHOR] |
| Copyright of SIAM Journal on Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 10699146 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: QUALITY MESH GENERATION IN HIGHER DIMENSIONS. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Mitchell%2C+Scott+A%2E%22">Mitchell, Scott A.</searchLink><relatesTo>1</relatesTo><i> samitch@sandia.gov</i><br /><searchLink fieldCode="AR" term="%22Vavasis%2C+Stephen+A%2E%22">Vavasis, Stephen A.</searchLink><relatesTo>2</relatesTo><i> vavasis@cs.cornell.edu</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22SIAM+Journal+on+Computing%22">SIAM Journal on Computing</searchLink>. 2000, Vol. 29 Issue 4, p1334. 37p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Numerical+grid+generation+%28Numerical+analysis%29%22">Numerical grid generation (Numerical analysis)</searchLink><br /><searchLink fieldCode="DE" term="%22ALGOL+%28Computer+program+language%29%22">ALGOL (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22C%2B%2B%22">C++</searchLink><br /><searchLink fieldCode="DE" term="%22Finite+element+method+data+processing%22">Finite element method data processing</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: We consider the problem of triangulating a d-dimensional region. Our mesh generation algorithm, called QMG, is a quadtree-based algorithm that can triangulate any polyhedral region including non-convex regions with holes. Furthermore, our algorithm guarantees a bounded aspect ratio triangulation provided that the input domain itself has no sharp angles. Finally, our algorithm is guaranteed never to over-refine the domain, in the sense that the number of simplices produced by QMG is bounded above by a factor times the number produced by any competing algorithm, where the factor depends on the aspect ratio bound satisfied by the competing algorithm. The QMG algorithm has been implemented in C++ and is used as a mesh generator for the finite element method. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of SIAM Journal on Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=10699146 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1137/S0097539796314124 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 37 StartPage: 1334 Subjects: – SubjectFull: Numerical grid generation (Numerical analysis) Type: general – SubjectFull: ALGOL (Computer program language) Type: general – SubjectFull: C++ Type: general – SubjectFull: Finite element method data processing Type: general Titles: – TitleFull: QUALITY MESH GENERATION IN HIGHER DIMENSIONS. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Mitchell, Scott A. – PersonEntity: Name: NameFull: Vavasis, Stephen A. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 02 Text: 2000 Type: published Y: 2000 Identifiers: – Type: issn-print Value: 00975397 Numbering: – Type: volume Value: 29 – Type: issue Value: 4 Titles: – TitleFull: SIAM Journal on Computing Type: main |
| ResultId | 1 |
