Two Parallel Computational Geometry Algorithms: A Discrete Voronoi Diagram with Disappearing Seeds and Convex Hull

Joseph Szakas; Christian Trefftz

doi:10.1109/IPDPS.2004.1303332

Parallel and Distributed Processing Symposium, International

Two Parallel Computational Geometry Algorithms: A Discrete Voronoi Diagram with Disappearing Seeds and Convex Hull

Year: 2004, Volume: 17, Pages: 262a

DOI Bookmark: 10.1109/IPDPS.2004.1303332

Authors

Joseph Szakas, University of Maine at Augusta
Christian Trefftz, Grand Valley State University

Abstract

Two Parallel Computational Geometry Algorithms are presented: One to calculate a Discrete Voronoi Diagram when one of the seeds is removed and one to calculate the convex hull in two dimensions. The model of parallel processing used for these algorithms assumes the availability of one processor per pixel. The recent growth in the capacity of FPGAs [5] and Systems-on-chip makes these algorithms interesting again.

Like what you’re reading?

Already a member?

Get this article FREE with a new membership!

A Raster-Based Algorithm for Voronoi Diagram Considering to Terrain
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering
Angular Voronoi Diagram with Applications
2006 3rd International Symposium on Voronoi Diagrams in Science and Engineering
The L_infinity (L_1) Farthest Line-Segment Voronoi Diagram
2012 Ninth International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2012)
Convex Hull Using K-Means Clustering in Hybrid (MPI/OpenMP) Environment
Computational Intelligence and Communication Networks, International Conference on
Parallel Algorithms to Find the Voronoi Diagram and the Order-k Voronoi Diagram
Parallel and Distributed Processing Symposium, International
Fast Two Dimensional Convex Hull on the GPU
2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications
Network Voronoi Diagram Based Range Search
2009 International Conference on Advanced Information Networking and Applications
Voronoi diagram and convex hull based geocasting and routing in wireless networks
Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003
Triangulation in a plane and 3D convex hull on mesh-connected arrays and hypercubes
Parallel Processing Symposium, International
Efficient Parallel Convex Hull Algorithms
IEEE Transactions on Computers

Two Parallel Computational Geometry Algorithms: A Discrete Voronoi Diagram with Disappearing Seeds and Convex Hull

Authors

Abstract

Related Articles