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

18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 15 p. 262a
Two Parallel Computational Geometry Algorithms: A Discrete Voronoi Diagram with Disappearing Seeds and Convex Hull
Joseph Szakas, University of Maine at Augusta
Christian Trefftz, Grand Valley State University

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2004.1303332
Send link to a friend

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.
Back to Top Additional Information
Citation: Joseph Szakas, Christian Trefftz, "Two Parallel Computational Geometry Algorithms: A Discrete Voronoi Diagram with Disappearing Seeds and Convex Hull," ipdps, p. 262a, 18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 15, 2004

	Advanced Search
CS Search Google Search