A new, sequential algorithm for polygonal approximation of plane, closed curves is presented, running in O(N) time and based on a tolerance independent of the scale factor.
An O(n) algorithm for polygonal approximation
Giuliana Dettori;
1985
Abstract
A new, sequential algorithm for polygonal approximation of plane, closed curves is presented, running in O(N) time and based on a tolerance independent of the scale factor.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_204730-doc_45743.pdf
non disponibili
Descrizione: An O(n) algorithm for polygonal approximation
Dimensione
689.8 kB
Formato
Adobe PDF
|
689.8 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
