PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES
نویسندگان
چکیده
منابع مشابه
Parallel Delaunay Refinement: Algorithms And Analyses
In this paper, we analyze the omplexity of natural parallelizations of Delaunay re nement methods for mesh generation. The parallelizations employ a simple strategy: at ea h iteration, they hoose a set of \independent" points to insert into the domain, and then update the Delaunay triangulation. We show that su h a set of independent points an be onstru ted eÆ iently in parallel and that the nu...
متن کاملParallel Guaranteed Quality Delaunay Uniform Mesh Refinement
We present a theoretical framework for developing parallel guaranteed quality Delaunay mesh generation software, that allows us to use commercial off-the-shelf sequential Delaunay meshers for two-dimensional geometries. In this paper, we describe our approach for constructing uniform meshes, in other words, the meshes in which all elements have approximately the same size. Our uniform distribut...
متن کاملDelaunay refinement algorithms for triangular mesh generation
Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive f...
متن کاملA Template for Developing Next Generation Parallel Delaunay Refinement Methods
We describe a complete solution for both sequential and parallel construction of guaranteed quality Delaunay meshes for general two-dimensional geometries. We generalize the existing sequential point placement strategies for guaranteed quality mesh refinement: instead of a specific position for a new point, we derive two types of two-dimensional regions which we call selection disks. Both types...
متن کاملDelaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Refinement
Creating in parallel guaranteed quality large unstructured meshes is a challenging problem. Parallel mesh generation procedures decompose the original mesh generation problem into smaller subproblems that can be solved in parallel. The subproblems can be treated as either completely or partially coupled, or they can be treated as completely decoupled. In this paper we present a parallel guarant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2007
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195907002227