Digital and Cellular Convexity.

Abstract

A new definition of cellular convexity is introduced. We then show that given a complex, it is cellularly convex if and only if the digital region determined by the complex is digitally convex. It is also shown that a digital region (a complex) is digitally (cellularly) convex if and only if the MPP of the digital region (the half-cell expansion of the complex) contains only the digital region (the centers of the cells of complex). An algorithm is presented for determining the concavity tree of a digital region or a complex. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1980
Accession Number
ADA092786

Entities

People

  • Chul E. Kim
  • Jack Sklansky

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Boundaries
  • Computer Science
  • Computers
  • Image Processing
  • Maryland
  • Mathematics
  • Pattern Recognition
  • Recognition
  • Scientific Research
  • Sequences
  • Universities

Readers

  • Computer Vision.
  • Electrochemical Engineering/ Fuel Cell Technologies
  • Graph Algorithms and Convex Optimization.