A Time-Optimal Parallel Algorithm for 3D Convex

0 downloads 0 Views 246KB Size Report
The sequential complexity of computing the convex hull of a set S of n points in
To appear in

Algorithmica

A Time-Optimal Parallel Algorithm for 3D Convex Hulls  Nancy M. Amatoy Coordinated Science Laboratory and Department of Computer Science University of Illinois 1308 W. Main St. Urbana, IL 61801 email:

Franco P. Preparataz Department of Computer Science Brown University Box 1910 Providence, RI 02912 email:

[email protected]

[email protected]

Abstract

In this paper we present an O( 1 log n) time parallel algorithm for computing the convex hull of n points in

Suggest Documents