Optimistic parallel Delaunay triangulation |
| |
| Authors: | Ivana Kolingerová Josef Kohout |
| |
| Affiliation: | (1) Centre of Computer Graphics and Data Visualisation, Department of Computer Science and Engineering, University of West Bohemia, Univerzitní 8, 306 14 Plzeň, Czech Republic, CZ |
| |
| Abstract: | The paper describes a new parallel algorithm of Delaunay triangulation based on randomized incremental insertion. The algorithm
is practical, simple and can be modified also for constrained triangulation or tetrahedralization. It was developed for architectures
with a lower degree of parallelism, such as several-processor workstations, and tested on up to 8 processors.
Published online: November 20, 2002
This work was supported by the Ministry of Education of The Czech Republic, project MSM 235 200 005 |
| |
| Keywords: | : Computer graphics – Computational geometry – Delaunay triangulation – Parallelization – Incremental insertion |
| 本文献已被 SpringerLink 等数据库收录！ |
|
