Design and data structure of fully adaptive, multigrid, finite-element software
ACM Transactions on Mathematical Software (TOMS)
Measuring parallel processor performance
Communications of the ACM
Automatic mesh generator with specified boundary
Computer Methods in Applied Mechanics and Engineering
A Delaunay refinement algorithm for quality 2-dimensional mesh generation
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Quality local refinement of tetrahedral meshes based on bisection
SIAM Journal on Scientific Computing
Adaptive refinement of unstructured finite-element meshes
Finite Elements in Analysis and Design
Parallel Algorithms for Adaptive Mesh Refinement
SIAM Journal on Scientific Computing
Parallel automatic adaptive analysis
Parallel Computing - Special issue on applications: parallel computing methods in applied fluid mechanics
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
PARED: A Framework for the Adaptive Solution of PDEs
HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
Repartitioning Unstructured Adaptive Meshes
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Parallel decoupled terminal-edge bisection method for 3D mesh generation
Engineering with Computers
Data Structures and Algorithm Analysis in C++ (3rd Edition)
Data Structures and Algorithm Analysis in C++ (3rd Edition)
Complexity of the bisection method
Theoretical Computer Science
Algorithm 872: Parallel 2D constrained Delaunay mesh generation
ACM Transactions on Mathematical Software (TOMS)
A multigrain Delaunay mesh generation method for multicore SMT-based architectures
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Lepp-bisection algorithms, applications and mathematical properties
Applied Numerical Mathematics
The Art of Concurrency: A Thread Monkey's Guide to Writing Parallel Applications
The Art of Concurrency: A Thread Monkey's Guide to Writing Parallel Applications
Lepp terminal centroid method for quality triangulation
Computer-Aided Design
Generalized Two-Dimensional Delaunay Mesh Refinement
SIAM Journal on Scientific Computing
Parallel Programming: for Multicore and Cluster Systems
Parallel Programming: for Multicore and Cluster Systems
Computational Geometry: Theory and Applications
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
Longest edge (nested) algorithms for triangulation refinement in two dimensions are able to produce hierarchies of quality and nested irregular triangulations as needed both for adaptive finite element methods and for multigrid methods. They can be formulated in terms of the longest edge propagation path (Lepp) and terminal edge concepts, to refine the target triangles and some related neighbors. We discuss a parallel multithread algorithm, where every thread is in charge of refining a triangle t and its associated Lepp neighbors. The thread manages a changing Lepp(t) (ordered set of increasing triangles) both to find a last longest (terminal) edge and to refine the pair of triangles sharing this edge. The process is repeated until triangle t is destroyed. We discuss the algorithm, related synchronization issues, and the properties inherited from the serial algorithm. We present an empirical study that shows that a reasonably efficient parallel method with good scalability was obtained.