Advertisement

Concurrency of Line Segments in Uncertain Geometry

  • Peter Veelaert
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2301)

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.

Keywords

Line Segment Parameter Vector Intersection Graph Interval Graph Supporting Line 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    H. Heijmans and A. Toet, “Morphological sampling,” CVGIP: Image Understanding, vol. 54, pp. 384–400, 1991.zbMATHCrossRefGoogle Scholar
  2. 2.
    P. Veelaert, “Geometric constructions in the digital plane,” J. Math. Imaging and Vision, vol. 11, pp. 99–118, 1999.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    P. Veelaert, “Graph-theoretical properties of parallelism in the digital plane,” submitted.Google Scholar
  5. 5.
    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.CrossRefGoogle Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    H. F. Durrant-Whyte, “Uncertain geometry in robotics,” IEEE Trans. Robotics Automat., pp. 23–31, 1988.Google Scholar
  9. 9.
    H. F. Durrant-Whyte, “Uncertain geometry,” in Geometric Reasoning (Kapur and Mundy, eds.), pp. 447–481, Cambridge: MITPress, 1989.Google Scholar
  10. 10.
    A. Fleming, “Geometric relationships between toleranced features,” in Geometric Reasoning (Kapur and Mundy, eds.), pp. 403–412, Cambridge: MITPress, 1989.Google Scholar
  11. 11.
    D. Lowe, “3-d object recognition from single 2-d images,” Artificial Intelligence, vol. 31, pp. 355–395, 1987.CrossRefGoogle Scholar
  12. 12.
    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.MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Peter Veelaert
    • 1
  1. 1.HogentGhentBelgium

Personalised recommendations