Computational geometry: an introduction
Computational geometry: an introduction
A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
Pattern Recognition Letters
Finding the convex hull of a sorted point set in parallel
Information Processing Letters
Triangulating a polygon in parallel
Journal of Algorithms
Visibility and intersection problems in plane geometry
Discrete & Computational Geometry
Optimal parallel algorithms for polygon and point-set problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Structured visibility profiles with applications to problems in simple polygons (extended abstract)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Parallel methods for visibility and shortest path problems in simple polygons (preliminary version)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
An Optimal Algorithm for Detecting Weak Visibility of a Polygon
IEEE Transactions on Computers
Planar separators and parallel polygon triangulation (preliminary version)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An Optimal Algorithm for Finding the Kernel of a Polygon
Journal of the ACM (JACM)
Journal of the ACM (JACM)
An O(log log n) time algorithm to compute the kernel of a polygon
Nordic Journal of Computing
| Hi-index | 0.01 |
The problem of detecting the weak visibility of an n-vertex simple polygon P is that of finding whether or not P is weakly visible from one of its edges and (if it is) identifying every edge from which P is weakly visible. In this paper, we present an optimal parallel algorithm for solving this problem. Our algorithm runs in O(log n) time using O(n/log n) processors in the CREW-PRAM computational model, and is very different from the sequential algorithms for this problem. This algorithm also enables us to optimally solve, in parallel, several other problems on weakly visible polygons.