Parallel Algorithms for Identification of Basis Polygons in an Image
Given a set of n straight line segments each described by its two end points, we propose two novel algorithms for detecting all basis polygons formed by them. The algorithms, based on traversals along the sides of the basis polygons, detect the polygons in O(n) time using n2 processors. The first algorithm handles the simple scenes consisting of convex basis polygons only, while the second one deals with the general situation. These algorithms have been simulated and tested for a number of input sets of intersecting line segments.
KeywordsParallel Algorithm Convex Polygon Straight Line Segment Current Line Current Vertex
Unable to display preview. Download preview PDF.
- P.V.C. Hough, “Methods and Means for Recognizing Complex Patterns,” U. S. Patent 3069654, 1962. 302Google Scholar
- C. Guerra and S. Hambrusch, “Parallel Algorithms for line detection in a mesh.” Journal of Parallel and Distributed Computing, vol. 6, pp. 1–19, February 1989. 302Google Scholar
- R.E. Cypher, J. L.C. Sanz and L. Snyder, “The Hough transform has O(N) complexity on N × N mesh connected computers,” SIAM J. Computing, vol. 19, pp. 805–820, October, 1990. 302Google Scholar
- P. Yi and H.Y.H. Chuang, “Parallel Hough transform algorithms on SIMD hypercube array,” Proc. International Conference on Parallel Processing, August 1990, pp. 83–86. 302Google Scholar
- T. Asano, K. Obokata and T. Tokuyama, “On detecting digital line components in a binary image,” Proc. Workshop on Computational Geometry, Calcutta, India, March 18–19, 2002. 302Google Scholar
- A. Sen, M. De, B. P. Sinha and A. Mukherjee, “A new parallel algorithm for identification of straight lines in images,” Proc. 8th International Conference on Advanced Computing and Communications, December 14-16, 2000, pp. 152–159. 302Google Scholar
- P. Heckbert (ed.), Graphics Gems IV. Academic Press, 1994. 302Google Scholar