Parallel algorithms for identifying convex and non-convex basis polygons in an image

Authors:
Arijit Laha;Amitava Sen;Bhabani P. Sinha
Affiliations:
Institute for Development and Research in Banking Technology Castle Hills, Hyderabad, India;Advanced Computing and Microelectronics Unit, Indian Statistical Institute, Calcutta, India;Advanced Computing and Microelectronics Unit, Indian Statistical Institute, Calcutta, India
Venue:
Parallel Computing
Year:
2005

Citing 9
Cited 0

An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons

Computing
On-line construction of the convex hull of a simple polyline

Information Processing Letters
A new O(n · logn) algorithm for computing the intersection of convex polygons

Pattern Recognition
The Problems of Accuracy and Robustness in Geometric Computation

Computer
Parallel algorithms for line detection on a mesh

Journal of Parallel and Distributed Computing
The Hough transform has O(N) complexity on N×-N mesh connected computers

SIAM Journal on Computing
Graphics gems IV

Graphics gems IV
A simple O(log N) time parallel algorithm for testing isomorphism of maximal outerplanar graphs

Journal of Parallel and Distributed Computing
Use of the Hough transformation to detect lines and curves in pictures

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose two novel parallel algorithms for identifying all the basis polygons in an image formed by n straight line segments each of which is represented by its two end points. The first algorithm is designed to tackle the simple situation where all basis polygons are convex. The second one deals with the general situation when the basis polygons can be both convex and non-convex. These algorithms are based on an idea of traversal along the periphery of the basis polygons in a well-defined manner so that each of these needs only O(n) time using an n × n processor array. Simulation results on various test input sets of intersecting line segments have also been found satisfactory.