Please use this identifier to cite or link to this item:
Title: A scan-line algorithm for clustering line segments
Authors: Κώστας, Κωνσταντίνος
Γκίνης, Αλέξανδρος - Αλβέρτος
Κακλής, Παναγιώτης Δ.
Item type: Conference publication
Conference Item Type: Full Paper
Keywords: Scan-Line Algorithm;Line Segments;Local Clustering;Global Clustering;Algorithm;Marine Design;Θαλάσσιος σχεδιασμός;Ευθύγραμμα τμήματα;Αλγόριθμοι;Τοπική ομαδοποίηση;Παγκόσμια ομαδοποίηση
Subjects: Marine engineering
Issue Date: 3-Feb-2015
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.
Language: English
Citation: Kostas, K.V., Ginnis, A.I. and Kaklis, P.D. (2004). A scan-line algorithm for clustering line segments. in Proccesing of the International Conference on Shape Modeling and Applications (SM & SMI 2004), IEEE computer society, Los Alamos, pp.379-382
Conference: International Conference on Shape Modeling and Applications, IEEE computer society
Access scheme: Embargo
License: Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες
Appears in Collections:Δημοσιεύσεις

Files in This Item:
File Description SizeFormat 
  Restricted Access
167.25 kBAdobe PDFView/Open Request a copy

This item is licensed under a Creative Commons License Creative Commons