@techreport{R-89-29,
TITLE = {A Sublogarithmic Parallel Algorithm for Finding the Convex Hull of Sorted Points},
AUTHOR = {Per-Olof Fj{\"a}llstr{\"o}m and Jyrki Katajainen and Christos Levcopoulos and Ola Petersson },
YEAR = {1989},
NUMBER = {R-89-29},
INSTITUTION = ida,
ADDRESS = idaaddr,
ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-89-29+abstr},
ABSTRACT = {We present a parallel algorithm for finding the convex hull of a sorted set of points in the plane. Our algorithm runs in O(log n/log log n) time using O(n log log n/log n) processors in the CRCW PRAM computational model, which is time and cost optimal. Our algorithm is based on cube root of n divide-and-conquer. Furthermore, we use a simple, pointer-based data structure.},
IDANR = {LiTH-IDA-R-89-29},
NOTE = {Also in BIT 30(1990), 378-384}