Order of points on a line segment

  • Atsushi Imiya
Part of the Advances in Computing Science book series (ACS)


The Hough transform is a method for the detection of many lines on a plane [1,2,3,4]. This method achieves line detection by converting the line fitting problem on an imaging plane to a peak search problem in an accumulator space using the voting procedure. Although the Hough transform provides a method for line detection, this transform can not detect line segments. For the detection of line segments, it is necessary to detect both endpoints of each line segment. The detection of pairs of endpoints of line segments is mainly performed using the point following procedure by local window operation along each line; that is, assuming the connectivity of digitized points, the algorithm follows a series of sample points which should lie on a line. The method is, however, equivalent to a whole area search in the worst case, because it is necessary to investigate the connectivity of all sample points in the region of interest, point by point.


Line Segment Line Detection Vote Procedure Binary Search Tree Planar Line 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Ballard, D. and Brown, Ch. M., Computer Vision, Prentice-Hall; New Jersey, 1982.Google Scholar
  2. [2]
    Xu, L. and Oja, E., Randomized Hough Transform (RHT): Basic mechanism, algorithm, and computational complexities, CVGIP:Image Understanding, 57, 131–154, (1993).CrossRefGoogle Scholar
  3. [3]
    Levers, V.F., Which Hough transform? CVGIP:Image Understanding, 58, 250–264, (1993).CrossRefGoogle Scholar
  4. [4]
    Kälviäinen, H., Hirvonen, P., Xu, L., and Oja. E., Probabilistic and non-probabilistic Hough transforms: Overview and comparisons, Image and Vision Computing, 13, 239–252, (1995).CrossRefGoogle Scholar
  5. [5]
    Sommerville, D.M.Y., Analytical Geometry of Three-dimensions, Cambridge University Press; Cambridge, 1934.Google Scholar
  6. [6]
    Cox, D., Little, J., and O’Shea, D., Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, Springer-Verlag; New York, 1992.MATHGoogle Scholar
  7. [7]
    Motwani, R. and Raghavan, P., Randomized Algorithms, Cambridge University Press; Cambridge, 1995.MATHGoogle Scholar

Copyright information

© Springer-Verlag/Wien 1997

Authors and Affiliations

  • Atsushi Imiya

There are no affiliations available

Personalised recommendations