Parallel Line Grouping Based on Interval Graphs
We use an interval graph to model the uncertainty of line slopes in a digital image. We propose two different algorithms that group lines into classes of lines that are parallel, or almost parallel. This grouping is strongly based on the Helly-type property of parallelism in the digital plane: a group of lines is digitally parallel if and only if each pair of lines is digitally parallel. As a result, the extraction of parallel groups is reduced to the extraction of cliques in the interval graph generated by the slope intervals. Likewise, the extraction of lines that are almost parallel becomes equivalent to the detection of subgraphs that resemble cliques.
- 1.H. F. Durrant-Whyte: Uncertain Geometry. In Geometric Reasoning, Eds. Kapur and Mundy, 447–481 (1989) 530Google Scholar
- 6.J.-P. Réveillès: Géométrie discrète, calcul en nombres entiers et algorithmique. Thèse de Doctorat d’Etat. Université Louis Pasteur, Strasbourg (1991) 532Google Scholar
- 9.P. Veelaert: Algorithms that measure parallelism and concurrency of lines in digital images. Proceedings of SPIE’s Conference on Vision Geometry VIII, (Denver), SPIE, 69–79 (1999) 530, 531, 533, 534, 535Google Scholar
- 10.P. Veelaert: Line grouping based on uncertainty modeling of parallelism and collinearity. Proceedings of SPIE’s Conference on Vision Geometry IX, (San Diego), SPIE (2000) 532Google Scholar