Sciweavers

Share
PAAPP
1998

Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*

10 years 3 months ago
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simple polygon. These include computing shortest paths, shortest path trees, shortest path partitions, all-farthest neighbors, the visibility polygon of a point, the weak visibility polygon of an edge, and the ray shooting problem.
Sumanta Guha
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 1998
Where PAAPP
Authors Sumanta Guha
Comments (0)
books