Skip to main content
Conference ProceedingsOPEN ACCESS

Domain decomposition coupled with Delaunay mesh generation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2329 LNCS(PART 1) 353-360
DOI: 10.1007/3-540-46043-8_35
0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a domain decomposition method for finite element meshes created using the Delaunay criterion. The decomposition is performed at the intermediate stage of the generation process and is successively refined as the number of nodes in the mesh increases. The efficiency of the algorithm and the quality of the partitioning is evaluated for different partition heuristics and various finite element meshes. © 2002 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Jurczyk, T., & Głut, B. (2002). Domain decomposition coupled with Delaunay mesh generation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2329 LNCS, pp. 353–360). Springer Verlag. https://doi.org/10.1007/3-540-46043-8_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free