A new algorithm for computing the Hough transform has been presented. It uses information present in the location of the feature points to reduce the generation of evidence in the transform plane. The algorithm gives improved performance compared with the standard Hough transform. The improvement is in computation time and memory allocation. Further advantages of using the algorithm are that peak detection is one dimensional and the end points of curves may be detected. The algorithm is also inherently parallel.