The Decomposition of an Arbitrary Three-Dimensional Planar Polygon Into a Set of Convex Polygons,
NAVAL POSTGRADUATE SCHOOL MONTEREY CA
Pagination or Media Count:
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 polygons 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.
- Theoretical Mathematics
- Computer Programming and Software