Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
P.V.C. Hough, “Methods and Means for Recognizing Complex Patterns,” U. S. Patent 3069654, 1962. 302
P.O. Duda and P.E. Hart, “Use of the Hough transformation to detect lines and curves in pictures,” Communications of the ACM, vol. 15, no. 1, pp. 11–15, 1972. 302
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. 302
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. 302
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. 302
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. 302
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. 302
D. McCallum and D. Avis, “A linear algorithm for finding the convex hull of a simple polygon,” Information Processing Letters, Vol. 9, 1979, pp. 201–206. 302
A.A. Melkman, “On-line construction of the convex hull of a simple polyline,” Information Processing Letters, Vol. 25, 1987, pp. 11–12. 302
P. Heckbert (ed.), Graphics Gems IV. Academic Press, 1994. 302
G. T. Toussaint, “A simple linear algorithm for intersecting convex polygons,” The Visual Computer, Vol. 1, 1985, pp. 118–123. 302
J. O’Rourke, “A new linear algorithm for intersecting convex polygons,” Comput. Graph. Image Processing Vol. 19, 1982, pp. 384–391. 302
S. Kundu, “A new O(n log n algorithm for computing the intersection of convex polygons,” Pattern Recognition, Vol. 20, 1987, pp. 419–424. 302
G. T. Toussaint, “An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons,” Computing, Vol. 32, 1984, pp. 357–364. 302
S. Sen Gupta and B.P. Sinha, “An O(log n) time algorithm for testing isomorphism of maximal outerplanar graphs”, Journal of Parallel and Distributed Computing, Vol. 56, 1999, pp. 144–156. 302
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laha, A., Sen, A., Sinha, B.P. (2002). Parallel Algorithms for Identification of Basis Polygons in an Image. In: Sahni, S., Prasanna, V.K., Shukla, U. (eds) High Performance Computing — HiPC 2002. HiPC 2002. Lecture Notes in Computer Science, vol 2552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36265-7_29
Download citation
DOI: https://doi.org/10.1007/3-540-36265-7_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00303-8
Online ISBN: 978-3-540-36265-4
eBook Packages: Springer Book Archive