A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification Under the Fréchet Distance
In this paper, we propose an algorithm that, from a maximum error and a digital curve (4- or 8-connected), computes a simplification of the curve (a polygonal curve) such that the Fréchet distance between the original and the simplified curve is less than the error. The Fréchet distance is known to...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Image Processing On Line
2014-05-01
|
| Series: | Image Processing On Line |
| Online Access: | http://www.ipol.im/pub/art/2014/70/ |