11 specifically we show that the voronoi map the euclidean distance map the maximal empty circles the largest empty circles and other related problems involving a binary image of size n x n can be solved in o log log n time using common crcw processors or in o log n time using erew processors 
