Skip to Main Content (Press Enter)

Logo CNR
  • ×
  • Home
  • People
  • Outputs
  • Organizations
  • Expertise & Skills

UNI-FIND
Logo CNR

|

UNI-FIND

cnr.it
  • ×
  • Home
  • People
  • Outputs
  • Organizations
  • Expertise & Skills
  1. Outputs

An O(n) algorithm for polygonal approximation

Academic Article
Publication Date:
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.
Iris type:
01.01 Articolo in rivista
Keywords:
poligonal approximation; digital representation; closed curves; algorithm
List of contributors:
Dettori, Giuliana
Handle:
https://iris.cnr.it/handle/20.500.14243/182823
Published in:
PATTERN RECOGNITION LETTERS
Journal
  • Use of cookies

Powered by VIVO | Designed by Cineca | 26.5.0.0 | Sorgente dati: PREPROD (Ribaltamento disabilitato)