Parallel Processing of Region Boundaries.

Abstract

A region may be represented by specifying the curves that bound it. When p processors are available, typical operations on regions so represented can be performed much faster than using a single processor. This paper presents parallel algorithms to determine properties of regions, such as area; to perform operations on regions, such as union and intersection; to determine if a point lies inside a region; and to determine whether a given digital curve could be the boundary of a region. Some of the algorithms involve sorting, the time complexity of which depends on the particular model of parallel computation used. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1985
Accession Number
ADA164112

Entities

People

  • Angela Y. Wu
  • Azriel Rosenfeld
  • S. K. Bhaskar

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Boundaries
  • Classification
  • Computations
  • Computer Science
  • Digital Image Processing
  • Digital Images
  • Image Processing
  • Mathematics
  • Parallel Computing
  • Parallel Processing
  • Security
  • Trees (Data Structures)
  • Universities

Fields of Study

  • Mathematics

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Fluid Mechanics and Fluid Dynamics.
  • Radar Systems Engineering.