A scan-line algorithm for clustering line segments

K. V. Kostas, A. I. Ginnis, P. D. Kaklis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

Transformation of hardcopy ship drawings to electronic ones is usually accomplished through scanning and rasterto-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 in this paper, consists of a scan-line processing of line segments that are grouped (clustered) with the aid of a moving scan-line and an appropriately defined distance to previously grouped entities. The performance of the algorithm is illustrated for the body-plan of a bulk carrier.

Original languageEnglish
Title of host publicationProceedings - Shape Modeling International SMI 2004
EditorsF. Giannini, A. Pasko
Pages379-382
Number of pages4
DOIs
Publication statusPublished - Nov 2 2004
EventProceedings - Shape Modeling International SMI 2004 - Genova, Italy
Duration: Jun 7 2004Jun 9 2004

Publication series

NameProceedings - Shape Modeling International SMI 2004

Other

OtherProceedings - Shape Modeling International SMI 2004
CountryItaly
CityGenova
Period6/7/046/9/04

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'A scan-line algorithm for clustering line segments'. Together they form a unique fingerprint.

  • Cite this

    Kostas, K. V., Ginnis, A. I., & Kaklis, P. D. (2004). A scan-line algorithm for clustering line segments. In F. Giannini, & A. Pasko (Eds.), Proceedings - Shape Modeling International SMI 2004 (pp. 379-382). (Proceedings - Shape Modeling International SMI 2004). https://doi.org/10.1109/SMI.2004.1314532