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.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | A Dynamic Programming Approach for Segmenting Digital Planar Curves into Line Segments and Circular Arcs |
Autori: | |
Data di pubblicazione: | 2008 |
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. |
Handle: | http://hdl.handle.net/11580/10785 |
ISBN: | 9781424421749 |
Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
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.