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!

Be the first to leave a comment!