Abstract
We examine the derivation of consistent concurrency relations in uncertain geometry. This work extends previous work on parallelism and collinearity. We introduce the concept of a metadomain, which is defined as the set of parameter vectors of lines passing through two domains, where a domain is defined as the uncertainty region of the parameter vector of a line segment. The intersection graph of the metadomains is introduced as the primary tool to derive concurrency relations.
Chapter PDF
References
H. Heijmans and A. Toet, “Morphological sampling,” CVGIP: Image Understanding, vol. 54, pp. 384–400, 1991.
P. Veelaert, “Geometric constructions in the digital plane,” J. Math. Imaging and Vision, vol. 11, pp. 99–118, 1999.
P. Veelaert, Parallel line grouping based on interval graphs, Proc. of DGCI 2000, vol. 1953 of Lecture Notes in Computer Science, pp. 530–541. Uppsala, Sweden: Springer, 2000.
P. Veelaert, “Graph-theoretical properties of parallelism in the digital plane,” submitted.
P. Veelaert, “Collinearity and weak collinearity in the digital plane,” Digital and Image Geometry, vol. 2243 of Lecture Notes in Computer Science, pp. 434–447, Springer, 2001.
P. Veelaert, “Line grouping based on uncertainty modeling of parallelism and collinearity,” in Proceedings of SPIE’s Conference on Vision Geometry IX, (San Diego), pp. 36–45, SPIE, 2000.
V. J. Milenkovic, “Verifiable implementations of geometric algorithms using finite precision arithmetic,” in Geometric Reasoning (Kapur and Mundy, eds.), pp. 377–401, Cambridge: MITPress, 1989.
H. F. Durrant-Whyte, “Uncertain geometry in robotics,” IEEE Trans. Robotics Automat., pp. 23–31, 1988.
H. F. Durrant-Whyte, “Uncertain geometry,” in Geometric Reasoning (Kapur and Mundy, eds.), pp. 447–481, Cambridge: MITPress, 1989.
A. Fleming, “Geometric relationships between toleranced features,” in Geometric Reasoning (Kapur and Mundy, eds.), pp. 403–412, Cambridge: MITPress, 1989.
D. Lowe, “3-d object recognition from single 2-d images,” Artificial Intelligence, vol. 31, pp. 355–395, 1987.
M. A. Fischler and R. C. Bolles, “Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography,” CACM, vol. 24, pp. 381–395, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Veelaert, P. (2002). Concurrency of Line Segments in Uncertain Geometry. In: Braquelaire, A., Lachaud, JO., Vialard, A. (eds) Discrete Geometry for Computer Imagery. DGCI 2002. Lecture Notes in Computer Science, vol 2301. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45986-3_26
Download citation
DOI: https://doi.org/10.1007/3-540-45986-3_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43380-4
Online ISBN: 978-3-540-45986-6
eBook Packages: Springer Book Archive