AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY …
Emerging
3
Citations0
Refs1995
Year
Search Works
Work Details
- DOI 10.1142/s0218195995000076
- OpenAlex ID W2109461981
- Type Article
- Language EN
- Published 01 Mar 1995
- Volume 05 (01n02)
- Pages 93–124
- Source International Journal of Computational G…
- Publisher World Scientific
- FWCI 0.67
- Countries 1
- Institutions 1
- Added 10 Oct 2025
- Updated 21 May 2026
External Links
MENU
0
AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
Article 1995 EN
The problem of detecting the weak visibility of an n-vertex simple polygon P is that of finding whether 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,…
3
Citations
0
References
1
Authors
0.67
FWCI
Topics
Keywords
Authors & Affiliations
1 authors| # | Author | Institutions | ORCID |
|---|---|---|---|
| 1 | Danny Z. Chen Corresponding | University of Notre Dame (US) |
Related Works
10Data: OpenAlex