Polygonal Simplification: An Overview
TR96-016
Carl Erikson (eriksonc@cs.unc.edu)

Polygonal simplification is a very active research topic, demonstrated by the
recent explosion of papers in the field.  The goal of this paper is to give a
foundation and overview of this rapidly growing research area.  The paper
provides a foundation by explaining what polygonal simplification is,
describing why it is useful, and defining some terminology of the field.  The
bulk of the paper classifies and overviews various simplification algorithms.
Finally, since polygonal simplfication is by no means a solved problem, the
paper discusses possible future work.

The University of North Carolina at Chapel Hill
Department of Computer Science
CB#3175, Sitterson Hall
Chapel Hill, NC  27599-3175