Abstract
We discuss the optimal grouping of collinear line segments, where we use a digital form of collinearity as the grouping criterion. We also introduce weak collinearity as a new concept to facilitate the design of an efficient line grouping algorithm. This algorithm is based on the use of simplicial elimination orderings, as known in graph theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Andres, R. Acharya, and C. Sibata: Discrete analytical hyperplanes. Graphical Models and Image Processing, 59, 302–309 (1997)
F. Gavril: Algorithms for minimum coloring, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph. SIAM J. Comput., 1, 180–187 (1972)
M. Grötschel, L. Lovász, and A. Schrijver: Geometric Algorithms and Combinatorial Optimization. New York: Springer-Verlag, 2nd Ed. (1993)
H. J. A. M. Heijmans and A. Toet: Morphological sampling. Computer Vision, Graphics & Image Processing: Image Understanding 54, 384–400 (1991)
D. Jacobs, D. Weinshall, and Y. Gdalyahu: Classification with nonmetric distances: image retrieval and class representation. IEEE Trans. Pattern Anal. Machine Intell., 22, 583–600, 2000.
D. Lowe: 3-d object recognition from single 2-d images. Artificial Intelligence, 31, 355–395, 1987.
P. Nacken: A metric for line segments. IEEE Trans. Pattern Anal. Machine Intell., 15,1312–1318, 1993.
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)
P. Veelaert: Geometric constructions in the digital plane. J. Math. Imaging and Vision. 11, 99–118 (1999)
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)
P. Veelaert: Line grouping based on uncertainty modeling of parallelism and collinearity. Proceedings of SPIE’s Conference on Vision Geometry IX, (San Diego), SPIE, 36–45 (2000)
P. Veelaert: Parallel line grouping based on interval graphs. Proceedings of DGCI 2000, (Uppsala), Springer, 530–541 (2000)
D. B. West: Introduction to Graph Theory. Upper Saddle River: Prentice Hall (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Veelaert, P. (2001). Collinearity and Weak Collinearity in the Digital Plane. In: Bertrand, G., Imiya, A., Klette, R. (eds) Digital and Image Geometry. Lecture Notes in Computer Science, vol 2243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45576-0_27
Download citation
DOI: https://doi.org/10.1007/3-540-45576-0_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43079-7
Online ISBN: 978-3-540-45576-9
eBook Packages: Springer Book Archive