Parallel algorithms for convex hull problems and their paradigm
A convex hull is one of the most fundamental and interesting geometric constructs ill computational geometry. Considerable research effort has focused on developing algorithms, both in serial and in parallel, for computing convex hulls. In particular, there are few I problems whose parallel algorithms are so thoroughly studied as convex hull problems. In this paper, we review the convex hull parallel algorithms and their paradigm. We provide a summary of results and introduce several interesting topics including typical techniques, output-size sensitive methods, randomized approaches, and robust algorithms for convex hull problems, with which we may see the highlights of the whole research for parallel algorithms, Most of our discussion uses the PRAM (Parallel Random Access Machine) computational model. but still we give a glance at the results of the other parallel computational models such as mesh, mesh-of-trees, hypercube, recofigurable array, and models of coarse grained multicomputers like BSP and LogP.
parallel algorithms convex hulls randomized algorithms output-size sensitive algorithms robust computational geometry