Highly Influenced

# Optimal parallel algorithms for computing convex hulls and for sorting

@article{Akl1984OptimalPA, title={Optimal parallel algorithms for computing convex hulls and for sorting}, author={Selim G. Akl}, journal={Computing}, year={1984}, volume={33}, pages={1-11} }

- Published 1984 in Computing
DOI:10.1007/BF02243071

A parallel algorithm is presented for computing the convex hull of a set ofn points in the plane. The algorithm usesn 1−ε processors, 0<ε<1, and runs inO(n ε logh) time, whereh is the number of edges on the convex hull, for a total cost ofO (n logh). This performance matches that of the best currently known sequential convex hull algorithm. In addition, sinceh≤n, the algorithm is worst-case optimal in view of the Ω (n logn) worst-case lower bound on sequential convex hull computation. It is… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

19 Citations

16 References

Similar Papers