Optimistic parallel Delaunay triangulation

Kolingerová, Ivana; Kohout, Josef

doi:10.1007/s00371-002-0173-z

Cited by 19 publications

(18 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…they do not need any synchronization in the location phase and their performance is comparable (or even better) than that of the methods presented in [32,5]. However, these methods are less scalable.…”

Section: Article In Pressmentioning

confidence: 92%

“…Such a test can be done either by system resources, or using the geometric properties of the Delaunay triangulation. A ''system'' implementation of this test was used in [32]. The possibility of using geometry based test is described below.…”

Section: The Circum-circle Methodsmentioning

confidence: 99%

“…In our previous work [32], we suggested two methods, both suitable for architectures with several processors and shared memory. They work with a shared DAG (Directed Acyclic Graph) structure, i.e.…”

Section: Construction Of the Delaunay Triangulationmentioning

confidence: 99%

“…This explains why the DAG structure is not a tree, although it resembles a tree. More details about this structure can be found in [4,32].…”

Section: Randomized Incremental Insertionmentioning

confidence: 99%

“…Therefore, we designed several methods based on the optimistic approach. They achieved better and, moreover, scalable speed-up [32]. The stress was put on efficiency rather than on simplicity of these methods, thus they usually require little synchronization even in the location phase, otherwise, artifacts in resulting Delaunay triangulation could appear.…”

Section: Algorithm 1 Parallel Delaunay Triangulation-master Threadmentioning

confidence: 99%

See 4 more Smart Citations

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

Kohout

Kolingerová

Žára

2004

Computers & Graphics

Self Cite

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

Section: Article In Pressmentioning

confidence: 92%

Section: The Circum-circle Methodsmentioning

confidence: 99%

Section: Construction Of the Delaunay Triangulationmentioning

confidence: 99%

“…This explains why the DAG structure is not a tree, although it resembles a tree. More details about this structure can be found in [4,32].…”

Section: Randomized Incremental Insertionmentioning

confidence: 99%

Section: Algorithm 1 Parallel Delaunay Triangulation-master Threadmentioning

confidence: 99%