The problem of defining a polygon with a limited number of sides in order to approximate a digitized curve occurs in different fields. In this paper we describe a new, iterative algorithm and we give an estimation of its computational complexity. The method is local, thus it can be used online or together with other procedures. It is not optimal, but it is fast and gives quite satisfactory results.
An on-line algorithm for polygonal approximation of digitized plane curves
Giuliana Dettori
1982
Abstract
The problem of defining a polygon with a limited number of sides in order to approximate a digitized curve occurs in different fields. In this paper we describe a new, iterative algorithm and we give an estimation of its computational complexity. The method is local, thus it can be used online or together with other procedures. It is not optimal, but it is fast and gives quite satisfactory results.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
