O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs.

Martin Fürer Xin He Ming-Yang Kao Balaji Raghavachari

Published in: SPAA (1992)

Keyphrases

straight line
parallel algorithm
planar graphs
hough transform
shared memory
worst case
feature points
line segments
minimum weight
lower bound
weighted graph
parallel version
image processing
approximate inference
undirected graph