The decomposition of an arbitrary three-dimensional planar polygon into a set of convex polygons
By: [by] Jeffrey H. Potts, Robert B. McGhee [and]Michael J. Zyda
Contributors: McGhee, Robert (Robert B.); Zyda, Michael J.; Naval Postgraduate School (U.S.)
Publisher: Naval Postgraduate School
Published: 1987
Place of publication: Monterey, California
Language: eng
Number of pages: 75
Subjects: Computer graphics; Polygons
Description: 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.
Notes: Title from cover.

"Prepared for: Chief of Naval Research"--Cover.

"February 1987"--Cover.

"NPS52-87-004"--Cover.

DTIC Identifiers: IRIS (Integrated Raster Imaging System)

Author(s) key words: Planar polygon decomposition, concave polygons, graphics workstations.

Includes bibliographical references (p. 33)

"Approved for public release; distribution unlimited"--Cover.

Technical report; 1987.

aq/aq cc:9116 06/04/99.

kmc/kmc 11/4/09.