Optimal Parallel Hull Construction for Simple Polygons in \calO(log log n) Time

Published in: FOCS (1992)

Keyphrases

worst case
minimum length
databases
massively parallel
convex hull
lower bound
dynamic programming
upper bound
social networks
optimal control
neural network
construction process
case study
database systems
decision making
general purpose
real time