By Topic

Time- and VLSI-optimal convex hull computation on meshes with multiple broadcasting

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

4 Author(s)
Bokka, V. ; Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA ; Gurla, H. ; Olariu, S. ; Schwing, J.L.

Computing the convex hull of a planar set of points is one of the most extensively investigated topics in computational geometry. Our main contribution is to present the first known general-case, time- and VLSI-optimal, algorithm for convex hull computation on meshes with multiple broadcasting. Specifically, we show that for every choice of a positive integer constant c, the convex hull of a set of m(n½+½c⩽m⩽n) points in the plane stored in the first [m/√n] columns of a mesh with multiple broadcasting of size √n×√n can be computed in Θ(m/√n) time. Our algorithm features a very attractive additional property, namely that the time to input the data, the time to compute the convex hull, as well as the time to output the result are essentially the same

Published in:

Frontiers of Massively Parallel Computation, 1995. Proceedings. Frontiers '95., Fifth Symposium on the

Date of Conference:

6-9 Feb 1995