A Modeless Convex Hull Algorithm for Simple Polygons.

Abstract

This document presents an orner n algorithm which computes the convex hull of a two-dimensional non-self-intersecting polygon. The algorithm recovers much of the simplicity of the one presented by Sklansky and subsequently disproved. Unlike several algorithms which have been found since then, the modified algorithm executes a truly uniform (modeless) traversal of all the vertices of the polygon. This makes it possible to extend the algorithm to extract geometric information about the interior of the polygon. (Author).

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1985
Accession Number
ADA159119

Entities

People

  • A. C. Sanderson
  • M. A. Peshkin

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Autonomy

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Cartesian Coordinates
  • Computations
  • Computer Programming
  • Computers
  • Corporations
  • Geometry
  • Information Theory
  • Mathematics
  • Quadrants
  • Robotics
  • Security
  • Sequences
  • Two Dimensional
  • Universities

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.