Simultaneous mesh generation and partitioning for Delaunay meshes

Chrisochoides, Nikos; Nave, Démian

doi:10.1016/s0378-4754(00)00192-0

Cited by 22 publications

(18 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, the application of linear and nonlinear symbolic analysis will be shown on two example circuits. 47. N. Boland, P. Domínguez-Marín, S. Nickel, J. Puerto…”

Section: Overview Of Symbolic Methods In Industrial Analog Circuit Dementioning

confidence: 99%

See 1 more Smart Citation

Domain Decomposition Approach for Automatic Parallel Generation of Tetrahedral Grids

Ivanov

Andrä

Kudryavtsev

2006

Comput. Methods Appl. Math.

View full text Add to dashboard Cite

The desire to simulate even more geometrical and physical features of technical structures and the availability of parallel computers and parallel numerical solvers which can exploit the power of these machines have led to a steady increase in the number of the grid elements used. Memory requirements and computational time are too large for usual serial PCs. An a priori partitioning algorithm for the parallel generation of 3D non-overlapping compatible unstructured meshes based on a CAD surface description is presented in this paper. Emphasis is placed on practical issues and implementation rather than on theoretical complexity. In order to achieve robustness of the algorithm with respect to the geometrical shape of the structure, the authors propose that there should be several or many but relatively simple algorithmic steps. The geometrical domain decomposition approach has been applied. It allows us to use standard 2D and 3D high-quality Delaunay mesh generators for independent and simultaneous volume meshing. Different aspects of load balancing methods are also explored in the paper. The MPI library and SPMD model are used for parallel grid generator implementation. Several 3D examples are given.

show abstract

“…Finally, the application of linear and nonlinear symbolic analysis will be shown on two example circuits. 47. N. Boland, P. Domínguez-Marín, S. Nickel, J. Puerto…”

Section: Overview Of Symbolic Methods In Industrial Analog Circuit Dementioning

confidence: 99%

“…Moving to three dimensions, the task becomes more complicated. Chew et al [28], Chrisochoides et al [47], Okunsanya et al [29] have parallelized the Delaunay algorithm.…”

Section: Introductionmentioning

confidence: 99%

Domain Decomposition Approach for Automatic Parallel Generation of Tetrahedral Grids

Ivanov

Andrä

Kudryavtsev

2006

Comput. Methods Appl. Math.

View full text Add to dashboard Cite

show abstract

“…Each point is inserted consecutively and the triangulation is locally updated to satisfy the circumsphere criterion. Parallel methods using this principle can be found in [8][9][10][11].…”

Section: Parallel Delaunay Triangulation Algorithmsmentioning

confidence: 99%

Parallel Delaunay triangulation for particle finite element methods

Fragakis

Oñate

2007

Commun. Numer. Meth. Engng.

View full text Add to dashboard Cite

SUMMARYDelaunay triangulation is a geometric problem that is relatively difficult to parallelize. Parallel algorithms are usually characterized by considerable interprocessor communication or important serialized parts. In this paper, we propose a method that achieves high speed-ups, but needs information regarding locally maximum element circumspheres prior to the beginning of the algorithm. Such information is directly available in iterative methods, like the particle finite element methods. The developed parallel Delaunay triangulation method, has minimum communication requirements, is quite simple and achieves high parallel efficiency.

show abstract

“…Chrisochoides et al [33,34] parallelize the well-known Bowyer-Watson's algorithm that is based on incremental insertion with cavity retriangulation [35]. First, the sequential algorithm creates a coarse triangulation of a subset of points.…”

Section: Construction Of the Delaunay Triangulationmentioning

confidence: 99%

Practically oriented parallel Delaunay triangulation in E2 for computers with shared memory

Kohout

Kolingerová

Žára

2004

Computers & Graphics

View full text Add to dashboard Cite

This paper describes two simple and efficient parallel algorithms for the construction of the Delaunay triangulation ðDTðSÞÞ in E 2 by randomized incremental insertion. The construction of the DTðSÞ is one of the fundamental problems in computer graphics. The proposed algorithms are designed for parallel systems several processors and with shared memory. Such a hardware configuration (especially the case with two-processors) became widely available in the last few years thanks to low prices at present, but there is still a lack of parallel algorithms that are simple to implement and efficient enough to be an attractive alternative to existing serial algorithms. We have implemented both new algorithms in C++ and tested them on workstations with up to four processors. Thanks to memory caching we noticed several times even super-linear speed-up compared with the reference sequential algorithm. r

show abstract

Simultaneous mesh generation and partitioning for Delaunay meshes

Cited by 22 publications

References 15 publications

Domain Decomposition Approach for Automatic Parallel Generation of Tetrahedral Grids

Domain Decomposition Approach for Automatic Parallel Generation of Tetrahedral Grids

Parallel Delaunay triangulation for particle finite element methods

Practically oriented parallel Delaunay triangulation in E2 for computers with shared memory

Contact Info

Product

Resources

About