Algorithms for Testing Convexity of Digital Polygons.

Abstract

A simple approach based on Shoenberg's theorem is described to test whether a set of border points of a simply 4-connected digital picture is convex. The sequential implementation of this method is linear in the number of points; the parallel algorithm needs constant time only, using bitwise parallel Boolean operations and shifts on binary matrices. Suitable modifications of this approach can be used for decomposing two-dimensional objects into convex sets and for filling concavities. (Author)

Open PDF

Document Details

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

Entities

People

  • E. V. Krishnamurthy
  • Reinhard Klette

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Boundaries
  • Change Detection
  • Computations
  • Computer Science
  • Convex Sets
  • Detection
  • Digital Image Processing
  • Digital Images
  • Image Processing
  • Images
  • Parallel Computing
  • Polygons
  • Scientific Research
  • Theorems
  • Universities

Readers

  • Graph Algorithms and Convex Optimization.
  • Image Processing and Computer Vision.