Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Parallel computational geometry
Parallel computational geometry
Performance measurements for multithreaded programs
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A study of common pitfalls in simple multi-threaded programs
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version)
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
A Time-Optimal Parallel Algorithm for the Computing of Voronoi-Diagrams
WG '88 Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science
Parallel algorithms for geometric problems
Parallel algorithms for geometric problems
Parallel algorithms for higher-dimensional convex hulls
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |
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.