loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Shape Modeling and Applications 2004 (SMI'04)
A Scan-Line Algorithm for Clustering Line Segments
Genova, Italy
June 07-June 09
ISBN: 0-7695-2075-8
K. V. Kostas, National Technical University of Athens
A. I. Ginnis, National Technical University of Athens
P. D. Kaklis, National Technical University of Athens
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 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.
Citation:
K. V. Kostas, A. I. Ginnis, P. D. Kaklis, "A Scan-Line Algorithm for Clustering Line Segments," smi, pp.379-382, International Conference on Shape Modeling and Applications 2004 (SMI'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.