Optimistic parallel Delaunay triangulation
Ivana Kolingerová, Josef Kohout
In The Visual Computer, 18(8), 2002.
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.
Keyword(s): Computer graphics, Computational geometry, Delaunay triangulation, Parallelization, Incremental insertion
@article{Kolingerova:2002:OPD,
author = {Ivana Kolingerová and Josef Kohout},
title = {Optimistic parallel Delaunay triangulation},
journal = {The Visual Computer},
volume = {18},
number = {8},
pages = {511--529},
year = {2002},
}
Return to the search page.
graphbib: Powered by "bibsql" and "SQLite3."