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

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.