Algorithms for massively parallel image processing architectures

Abstract

The complexity of efficiently programming massively parallel machines is illustrated by presenting a number of algorithms. These algorithms deal with computational geometry, data histogramming, list manipulation, and other problems or operations that arise in computer vision tasks. All of the algorithms presented use a divide-and-conquer strategy, and they all use routines that solve a problem of size M using a machine size N, where M>