Cluster detection in a collection of collinear line segments

摘要

Two novel methods of clustering of a collection of collinear line segments are presented. Both the methods are of merging type, global in nature and take into account both gap and line segment lengths. The methods are also useful for clustering collinear dot patterns. The efficacy of the algorithms is brought out by successfully applying them on different types of data sets. A comparative study is made by comparing the results of the proposed procedures with that of another procedure already existing.