A variation of the Hough Transform that is aimed at detecting digital lines has been recently suggested. Other Hough algorithms are intended to detect straight lines in the anaThe Hough Transform [2,4] is a well known technique for recognizing predefined features in edge maps. In this paper, the Hough Transform for detecting straight lines is considered.Most Hough algorithms consist of an incrementation stage, in which each edge point "votes" for the parameter-pairs of all possible straight lines on which it can lie, and an exhaustive search for peaks. These correspond to large collinear sets of edge-points.Originally, the slope-intercept (m,b) parametrization of straight lines had been employed in the Hough Transform. It has the advantage that an edge point corresponds to a straight line in the parameter space, thus voting is simple. Its drawback is that the parameter space is unbounded, implying some theoretical and practical difficulties. With normal (p,0) parametrization of straight lines, as suggested by [2], an edge point corresponds to a sinusoid in the parameter space, thus voting is somewhat more complex. The normal parametrization has the advantage that a bounded image leads to a bounded parameter space. Other straight-line parametrizations have also been suggested, see [4,11,17].In most implementations of the Hough algorithm the parameter space is represented by a rectangular accumulator array, such that each accumulator corresponds to a rectangular, constant size domain in the parameter space. The quantization of the parameter space greatly influences the resolution and detection capabilities of the algorithm, as well as the computational and storage requirements; see [6,16].