A fast parallel algorithm for finding the convex hull of a sorted point set.

Omer Berkman Baruch Schieber Uzi Vishkin

Published in: Int. J. Comput. Geom. Appl. (1996)

Keyphrases

convex hull
parallel algorithm
point sets
closest points
point cloud
computational geometry
parallel computation
point set registration
mixed integer
cluster of workstations
convex polyhedra
database systems
training samples
data points
icp algorithm
point pairs
high dimensional
pairwise
data sets