@techreport{R-89-30, TITLE = {Approximation of Polygonal Lines}, AUTHOR = {Per-Olof Fj{\"a}llstr{\"o}m}, YEAR = {1989}, NUMBER = {R-89-30}, INSTITUTION = ida, ADDRESS = idaaddr, ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-89-30+abstr}, ABSTRACT = {Given a polygonal line P and a scalar value d, we present an algorithm that determines a polygonal approximation Q of P in O(n2) time. The approximation can be characterized as follows. The vertices of Q is a minimal subsequence of the vertices of P, such that, each edge of Q is either identical of an edge of P, or it replaces a connected subchain of edges of P. In the latter case, the edge must not deviate more than distance d from the vertices of the subchain.}, IDANR = {LiTH-IDA-R-89-30}