Computing digitized voronoi diagrams on a systolic screen and applications to clustering

  • Frank Dehne
Conference paper

DOI: 10.1007/3-540-51859-2_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 401)
Cite this paper as:
Dehne F. (1989) Computing digitized voronoi diagrams on a systolic screen and applications to clustering. In: Djidjev H. (eds) Optimal Algorithms. Lecture Notes in Computer Science, vol 401. Springer, Berlin, Heidelberg

Abstract

A systolic screen of size M is a √M × √M mesh-of-processors where each processing element Pij represents the pixel (i,j) of a digitized plane П of √M × √M pixels. In this paper we study the computation of the Voronoi diagram of a set of n planar objects represented by disjoint images contained in П. We present O(√M) time algorithms to compute the Voronoi diagram for a large class of object types (e.g., points, line segments, circles, ellipses, and polygons of constant size) and distance functions (e.g., all Lp metrices).

Since the Voronoi diagram is used in many geometric applications, the above result has numerous consequences for the design of efficient image processing algorithms on a systolic screen. We obtain, e.g., an O(√M) time systolic screen algorithm for "optical clustering"; i.e., identifying those groups of objects in a digitized picture that are "close" in the sense of human perception.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Frank Dehne
    • 1
  1. 1.Center for Parallel and Distributed Computing School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations