A scan-line algorithm for clustering line segments

Kostas, K; Ginnis, A; Kaklis, P

dc.contributor.author	Kostas, K	en
dc.contributor.author	Ginnis, A	en
dc.contributor.author	Kaklis, P	en
dc.date.accessioned	2014-03-01T02:42:25Z
dc.date.available	2014-03-01T02:42:25Z
dc.date.issued	2004	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/30998
dc.title	A scan-line algorithm for clustering line segments	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/SMI.2004.1314532	en
heal.identifier.secondary	http://dx.doi.org/10.1109/SMI.2004.1314532	en
heal.publicationDate	2004	en
heal.abstract	Transformation of hardcopy ship drawings to electronic ones is usually accomplished through scanning and raster-to-vector conversions. Such conversions are, however, limited to produce low-degree vector entities, such as line segments, poly-lines and circular arcs. As a consequence, free-form curves, appearing in the original hardcopy, are usually disintegrated to a significant number of overlapping line and/or arc segments. The algorithm presented	en
heal.journalName	Shape Modeling International	en
dc.identifier.doi	10.1109/SMI.2004.1314532	en