Parallel Delaunay triangulation in E$<$sup$>$3$<$/sup$>$: make it simple
Josef Kohout, Ivana Kolingerová
In The Visual Computer, 19(7-8), 2003.
Abstract: The randomized incremental insertion algorithm of Delaunay triangulation in E3 is very popular due to its simplicity and stability. This paper describes a new parallel algorithm based on this approach. The goals of the proposed parallel solution are not only to make it efficient but also to make it simple. The algorithm is intended for computer architectures with several processors and shared memory. Several versions of the proposed method were tested on workstations with up to eight processors and on datasets of up to 200000 points with favorable results.
Keyword(s): Delaunay triangulation, Paralellization, Incremental insertion, Tetrahedronization
@article{Kohout:2003:PDT,
author = {Josef Kohout and Ivana Kolingerová},
title = {Parallel Delaunay triangulation in E$<$sup$>$3$<$/sup$>$: make it simple},
journal = {The Visual Computer},
volume = {19},
number = {7-8},
pages = {532--548},
year = {2003},
}
Return to the search page.
graphbib: Powered by "bibsql" and "SQLite3."