We present a method for segmenting a planar digital curve into line segments and circular arcs. It is based on Dynamic Programming and works in a transformed domain which makes the approximation process simpler and independent from the particular geometrical primitive considered. Experiments performed on some shapes confirm the effectiveness of the approach.

A Dynamic Programming Approach for Segmenting Digital Planar Curves into Line Segments and Circular Arcs

F. TORTORELLA
;
2008-01-01

Abstract

We present a method for segmenting a planar digital curve into line segments and circular arcs. It is based on Dynamic Programming and works in a transformed domain which makes the approximation process simpler and independent from the particular geometrical primitive considered. Experiments performed on some shapes confirm the effectiveness of the approach.
2008
9781424421749
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11386/4721732
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? 0
social impact