Parallel Algorithms for Identification of Basis Polygons in an Image

Authors:
Arijit Laha;Amitava Sen;Bhabani P. Sinha
Affiliations:
-;-;-
Venue:
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Year:
2002

Citing 8
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
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

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.