Abstract:
We present a logarithmic algorithm for performing parallel re nement of triangular
meshes by the widely used longest edge bisection procedure. We show that the
re nement propagation forms a data dependency which can be expressed as a forest of
directed trees. We solve a parallel Euler Tour problem on the trees to propagate the
re nement. After propagation, we apply re nement templates. Our algorithm improves
earlier reported results which had linear worst case complexity.
Citations
|
557
|
An Introduction to Parallel Algorithms
– JaJa
- 1992
|
|
103
|
A.: Refinement Algorithms and Data Structures for Regular Local Mesh Refinement
– BANK, SHERMAN, et al.
|
|
98
|
On the angle condition in the finite element method
– Babuska, Aziz
- 1976
|
|
67
|
Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
– Rivara
- 1984
|
|
40
|
Quality local refinement of tetrahedral meshes based on bisection
– Liu, Joe
- 1995
|
|
37
|
Efficient Parallel Algorithms for Graph Problems
– Kruskal
- 1986
|
|
31
|
A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
– RIVARA, LEVIN
- 1992
|
|
30
|
Condition of finite element matrices generated from nonuniform meshes
– Fried
- 1972
|
|
24
|
Parallel algorithms for adaptive mesh refinement
– Jones, Plassmann
- 1997
|
|
23
|
Parallel automated adaptive procedures for unstructured meshes
– Shephard, Flaherty, et al.
- 1995
|
|
12
|
A combined octree/Delaunay method for fully automatic 3-d mesh generation
– Schroeder, Shephard
- 1990
|
|
9
|
An adaptive finite-element strategy for the three-dimensional timedependent Navier-Stokes equations
– Bansch
- 1991
|
|
8
|
The dynamic adaptation of parallel mesh-based computation
– Castaños, Savage
- 1997
|
|
4
|
A representation of a distribution power network graph
– Szymanski, Minczuk
- 1978
|
|
2
|
refinement processes based on the generalized bisection of simplices
– Mesh
- 1984
|
|
2
|
A dynamic solution-adaptive unstructured parallel solver
– Williams
- 1992
|
