2000
DOI: 10.1007/3-540-45591-4_69
|View full text |Cite
|
Sign up to set email alerts
|

A Parallel, Adaptive Refinement Scheme for Tetrahedral and Triangular Grids

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2002
2002
2010
2010

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 2 publications
0
1
0
Order By: Relevance
“…ADH evolves the mesh resolution to efficiently capture dynamic boundary conditions, forcing functions, and sharp fronts. ADH runs on parallel architectures because problems of interest have high memory and/or run-time requirements [9,24]. This paper describes the mesh refinement and unrefinement algorithms used to control mesh evolution in ADH.…”
Section: Introductionmentioning
confidence: 99%
“…ADH evolves the mesh resolution to efficiently capture dynamic boundary conditions, forcing functions, and sharp fronts. ADH runs on parallel architectures because problems of interest have high memory and/or run-time requirements [9,24]. This paper describes the mesh refinement and unrefinement algorithms used to control mesh evolution in ADH.…”
Section: Introductionmentioning
confidence: 99%