The decomposition of an arbitrary three-dimensional planar polygon into a set of convex polygons
McGhee, Robert B.
Zyda, Michael J.
Potts, Jeffrey Hal
MetadataShow full item record
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
NPS Report NumberNPS52-87-044
Showing items related by title, author, creator and subject.
Caddell, Tymothy Wayne (Monterey, California. Naval Postgraduate School, 1991-12);The Naval Postgraduate School in Monterey, California is currently working on an ongoing project for research in autonomous underwater vehicle (AUV) technology. This project comprises two areas of research. the first ...
Lasser, Dieter (Monterey, California. Naval Postgraduate School, 1988-03); NPS-53-88-001A user-friendly divide-and-conquer algorithm is presented for finding all the self intersection points of a parametric curve in the Bernstein-Bezier representation. The underlying idea of the algorithm is to deal with the ...
Chrislip, Christopher Allen.; Ehlert, James Frederick. (Monterey, California. Naval Postgraduate School, 1995-09);NPSNET-IV.7J has a limited capability to display up to 10 Dismounted Infantry (DI) icons due to the enormous number of rendered polygons and computational load required. In order to provide a more realistic training scenario ...