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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Published online: November 20, 2002
This work was supported by the Ministry of Education of The Czech Republic, project MSM 235 200 005
Rights and permissions
About this article
Cite this article
Kolingerová, I., Kohout, J. Optimistic parallel Delaunay triangulation. Visual Comp 18, 511–529 (2002). https://doi.org/10.1007/s00371-002-0173-z
Issue Date:
DOI: https://doi.org/10.1007/s00371-002-0173-z