A BSP realisation of Jarvis' algorithm

The purpose of this paper is to present a very efficient parallel algorithm for computing the convex hull in the plane. We propose a parallel version of the Jarvis' march, realised using the bulk synchronous parallel (BSP) model and which takes O( nh/ p) time (where p is the number of processor...

Full description

Saved in:
Bibliographic Details
Published in:Pattern recognition letters Vol. 22; no. 2; pp. 147 - 155
Main Authors: Cinque, L., Di Maggio, C.
Format: Journal Article
Language:English
Published: Elsevier B.V 01.02.2001
Subjects:
Bulk synchronous parallelism
Convex-hull
Parellel programming
Convex-hull
Bulk synchronous parallelism
Parellel programming
ISSN:0167-8655, 1872-7344
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The purpose of this paper is to present a very efficient parallel algorithm for computing the convex hull in the plane. We propose a parallel version of the Jarvis' march, realised using the bulk synchronous parallel (BSP) model and which takes O( nh/ p) time (where p is the number of processors, h the number of vertices of the convex hull and n is the problem size) against the O( nh) complexity of the sequential algorithm. Furthermore, we give the experimental results obtained testing the algorithm implementation on a 16-node IBM Scalable POWERparallel 2 (SP2) and we compare them with the theoretical performance prediction obtained using the BSP cost calculus model.
ISSN:0167-8655
1872-7344
DOI:10.1016/S0167-8655(00)00102-1