A Linear Time Convex Hull Algorithm for Simple Polygons.

Abstract

An algorithm is presented that finds the convex hull of any orderly sequence of points in linear time. It is then shown that any simple polygon is an orderly sequence. Hence, the algorithm constructs that convex hull of any simple polygon in linear time. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1980
Accession Number
ADA092936

Entities

People

  • Chul E. Kim

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Algorithms
  • Computer Science
  • Computers
  • Convex Sets
  • Image Processing
  • Maryland
  • Mathematics
  • Pattern Recognition
  • Scientific Research
  • Security
  • Sequences
  • Universities

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.