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 be special graphics hardware. An implementation of the algorithm for the IRIS workstation is discussed. Keywords: Planar polygon decomposition; Concave polygons; Graphics workstations.

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1987
Accession Number
ADA181246

Entities

People

  • Jeffrey H. Potts
  • Michael Zyda
  • Robert B. Mcghee

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Coordinate Systems
  • Decomposition
  • Graphics
  • Mathematics
  • Rotation
  • Three Dimensional
  • Translations

Readers

  • Computer Vision.