By Topic

Two parallel computational geometry algorithms: a discrete Voronoi diagram with disappearing seeds and convex hull

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
J. Szakas ; Dept. of Comput. Sci., Maine Univ., Augusta, ME, USA ; C. Trefftz

Summary form only given. 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 and systems-on-a-chip makes these algorithms interesting again.

Published in:

Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International

Date of Conference:

26-30 April 2004