Paper
1 December 1993 Solving city block metric and digital geometry problems on the BSR model of parallel computation
Robert A. Melter, Ivan Stojmenovic
Author Affiliations +
Proceedings Volume 2060, Vision Geometry II; (1993) https://doi.org/10.1117/12.165010
Event: Optical Tools for Manufacturing and Advanced Automation, 1993, Boston, MA, United States
Abstract
in this paper we solve several geometric and image problems using the BSR (broadcasting with selective reduction) model of parallel computation. All of the solutions presented are constant time algorithms. The computational geometry problems are based on city block distance metrics: all nearest neighbors and furthest pairs of m points in a plane are computed on a two criteria BSR with m processors, the all nearest foreign neighbors and the all furthest foreign pairs of m points in the plane problems are solved on three criteria BSR with m processors while the area and perimeter of m iso-oriented rectangles are found on a one criterion BSR with m2 processors. The problems on an nxn binary image which are solved here all use BSR with n2 processors and include: histogramming (one criterion), distance transform (one criterion), medial axis transform (three criteria) and discrete Voronoi diagram of labeled images (two criteria).
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Robert A. Melter and Ivan Stojmenovic "Solving city block metric and digital geometry problems on the BSR model of parallel computation", Proc. SPIE 2060, Vision Geometry II, (1 December 1993); https://doi.org/10.1117/12.165010
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image processing

Algorithm development

Binary data

Vision geometry

Lithium

Chromium

Process modeling

Back to Top