Idioma:

Algorithm 872 : Parallel 2D Constrained Delaunay Mesh Generation

CHERNIKOV, Andrey N ; CHRISOCHOIDES, Nikos P

ACM transactions on mathematical software, 2008, Vol.34 (1), p.1-20 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
Algorithm 872 : Parallel 2D Constrained Delaunay Mesh Generation
Autor: CHERNIKOV, Andrey N ; CHRISOCHOIDES, Nikos P
Assuntos: Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Computational techniques ; Computer science; control theory; systems ; Exact sciences and technology ; Mathematical methods in physics ; Physics ; Theoretical computing
É parte de: ACM transactions on mathematical software, 2008, Vol.34 (1), p.1-20
Notas: ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
Descrição: Delaunay refinement is a widely used method for the construction of guaranteed quality triangular and tetrahedral meshes. We present an algorithm and a software for the parallel constrained Delaunay mesh generation in two dimensions. Our approach is based on the decomposition of the original mesh generation problem into N smaller subproblems which are meshed in parallel. The parallel algorithm is asynchronous with small messages which can be aggregated and exhibits low communication costs. On a heterogeneous cluster of more than 100 processors our implementation can generate over one billion triangles in less than 3 minutes, while the single-node performance is comparable to that of the fastest to our knowledge sequential guaranteed quality Delaunay meshing library (the Triangle).
Editor: New York, NY: Association for Computing Machinery
Idioma: Inglês

Links

Voltar para lista de resultados