**Dept. of Computer and Information science, Linköping University**

## IDA Technical Reports: abstract

*Generated: Fri, 18 Apr 2014 08:05:30 *

Fjällström, P.-O. (1989).
**Approximation of Polygonal Lines**.
Technical Report LiTH-IDA-R-89-30, Department of Computer and Information
Science, Linköping University, Sweden.
(bibtex),

**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.

**Goto (at Linköping University):**
```
CS Dept
TR Overview
```

*<webmaster@ida.liu.se>*