Convex Digital Solids.

Abstract

A definition of convexity of digital solids is introduced. Then it is proved that a digital solid is convex if and only if it has the chordal triangle property. Other geometric properties which characterize convex digital regions are shown to be only necessary, but not sufficient, conditions for a digital solid to be convex. An efficient algorithm is presented that determined whether or not a digital solid is convex. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1980
Accession Number
ADA090539

Entities

People

  • Azriel Rosenfeld
  • Chul E. Kim

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Computational Complexity
  • Computer Science
  • Computers
  • Digital Image Processing
  • Digital Images
  • Geometry
  • Image Processing
  • Images
  • Pattern Recognition
  • Polygons
  • Recognition
  • Sequences
  • Three Dimensional
  • Triangles
  • Universities

Readers

  • Graph Algorithms and Convex Optimization.
  • Materials Science and Engineering.
  • Radio communications and signal processing.