The Decomposition of an Arbitrary Three-Dimensional Planar Polygon into a Set of Convex Polygons.

Abstract

This study presents a three step algorithm for the decomposition of arbitrary, three dimensional, planar polygons into convex polygons. Through a series of translations and rotations, an arbitrary polygon is mapped onto the x-y plane, then broken into a set of convex polygons, and finally mapped back to the polygon's original coordinate system for filling and display by special graphics hardware. Keywords: Computer graphics; polygons; polygon decomposition; polygon concavity.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1986
Accession Number
ADA177947

Entities

People

  • Jeffrey H. Potts

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Classification
  • Coefficients
  • Computer Graphics
  • Computer Programs
  • Computer Science
  • Computers
  • Coordinate Systems
  • Geometry
  • Graphics
  • Lists (Data Structures)
  • Pattern Recognition
  • Schools
  • Security
  • Three Dimensional
  • Translations
  • Two Dimensional
  • United States

Readers

  • Computer Science/Computer Engineering/Data Science/Digital Signal Processing.
  • Graph Algorithms and Convex Optimization.