By Topic

Square meshes are not optimal for convex hull computation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Bhagavathi, D. ; Dept. of Comput. Sci., Southern Illinois Univ., Edwardsville, IL, USA ; Gurla, H. ; Olariu, S. ; Schwing, J.L.
more authors

Recently it has been noticed that for semigroup computations and for selection, rectangular meshes with multiple broadcasting yield faster algorithms than their square counterparts. The contribution of the paper is to provide yet another example of a fundamental problem for which this phenomenon occurs. Specifically, we show that the problem of computing the convex hull of a set of n sorted points in the plane can be solved in O(n 18/ log 34/) time on a rectangular mesh with multiple broadcasting of size n 38/ log 14/ n×n 58//log 14/n. The fastest previously known algorithms on a square mesh of size √n×√n run in O(n 16/) time in case the n points are pixels in a binary image, and in O(n 16/log 32/ n) time for sorted points in the plane.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:7 ,  Issue: 6 )