Parallel Computation of Contour Properties.

Abstract

Some contour properties can be derived in parallel by a string or cycle of automata in linear time, faster than can be done with a single processor. In particular the intersection points of two contours, the straightness of a line, the union or intersection of two contours, and polygonal approximations of a contour are computed in linear time. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1979
Accession Number
ADA081308

Entities

People

  • Angela Y. Wu
  • Azriel Rosenfeld
  • Tsvi Dubitzki

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Automata
  • Computations
  • Computer Science
  • Computer Vision
  • Computers
  • Coordinate Systems
  • Curvature
  • Detection
  • Image Processing
  • Maryland
  • Parallel Computing
  • Pattern Recognition
  • Polygons
  • Recognition
  • Scientific Research
  • Universities

Fields of Study

  • Mathematics

Readers

  • Geodesy
  • Graph Algorithms and Convex Optimization.