Design and Multithreading Implementation of the Wave-Front Algorithm for Constructing Voronoi Diagrams

Abstract

AbstractThe Voronoi diagram is one of the most fundamental data structures in computational geometry, which is concerned with the design and analysis of algorithms for geometrical problems. In this paper, a parallel algorithm for constructing the Voronoi diagram on CREW (Concurrent Read and Exclusive Write) model is proposed. This is an improved algorithm based on Preilowski and Mumbeck’s work. In their algorithm, they apply the Neighbor-Point-Theorem and present a parallel approach to check neighbor points. In this article, we propose an improved approach, Wave-Front algorithm, which is a quite different way to check neighbor points. The algorithm is then implemented in both sequential and multithreaded models.Since the Wave-Front algorithm has inherently concurrent tasks that can be executed simultaneously, multithreaded version was executed to observe the performance. Computational results indicate the effectiveness of the threaded model.KeywordsParallel AlgorithmVoronoi DiagramNeighbor PointConcurrent TaskVoronoi PolygonThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.