Design and multithreading implementation of the wave-front algorithm for constructing voronoi diagrams

  • Authors:
  • Grace J. Hwang;Joseph M. Arul;Eric Lin;Chung-Yun Hung

  • Affiliations:
  • Department of Computer Science and Information Engineering, Fu Jen Catholic University, Taipei, Taiwan;Department of Computer Science and Information Engineering, Fu Jen Catholic University, Taipei, Taiwan;Department of Computer Science and Information Engineering, Fu Jen Catholic University, Taipei, Taiwan;Department of Computer Science and Information Engineering, Fu Jen Catholic University, Taipei, Taiwan

  • Venue:
  • ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The 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.