An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point.

Mikhail J. Atallah Danny Z. Chen Hubert Wagener

Published in: J. ACM (1991)

Keyphrases

parallel algorithm
binary search trees
dominant points
simple polygon
parallel computation
medial axis transform
optimal solution
shared memory
parallel programming
parallel version
convex hull
dynamic programming
parallel implementations
graphical models
digital curves
discovery of association rules