Optimal polygonal approximation of digital curves

Papakonstantinou, G

dc.contributor.author	Papakonstantinou, G	en
dc.date.accessioned	2014-03-01T01:06:27Z
dc.date.available	2014-03-01T01:06:27Z
dc.date.issued	1985	en
dc.identifier.issn	0165-1684	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9392
dc.subject	data compression	en
dc.subject	Digital curves	en
dc.subject	optimal polygonal approximation	en
dc.subject	piecewise linear approximation	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.other	MATHEMATICAL TECHNIQUES - Piecewise Linear Techniques	en
dc.subject.other	DIGITAL CURVES	en
dc.subject.other	OPTIMAL POLYGONAL APPROXIMATION	en
dc.subject.other	PIECEWISE LINEAR APPROXIMATION	en
dc.subject.other	PATTERN RECOGNITION	en
dc.title	Optimal polygonal approximation of digital curves	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/0165-1684(85)90094-5	en
heal.identifier.secondary	http://dx.doi.org/10.1016/0165-1684(85)90094-5	en
heal.language	English	en
heal.publicationDate	1985	en
heal.abstract	An algorithm is described in this paper which finds the optimal polygonal approximation of a digital curve i.e. an approximation with the minimum possible number of line segments. The algorithm can be used either for digital curves in 2-space or 1-space, i.e. in waveforms. © 1985.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Signal Processing	en
dc.identifier.doi	10.1016/0165-1684(85)90094-5	en
dc.identifier.isi	ISI:A1985AHJ5200010	en
dc.identifier.volume	8	en
dc.identifier.issue	1	en
dc.identifier.spage	131	en
dc.identifier.epage	135	en