An optimal parallel algorithm for detecting weak visibility …
Emerging
8
Citations23
Refs1992
Year
Search Works
Work Details
- DOI 10.1145/142675.142692
- OpenAlex ID W2079373520
- Type Conference-paper
- Language EN
- Published 01 Jan 1992
- Pages 63–72
- Source Annual Symposium on Computational Geomet…
- FWCI 0.88
- Countries 1
- Institutions 1
- Added 10 Oct 2025
- Updated 05 Oct 2026
External Links
MENU
0
An optimal parallel algorithm for detecting weak visibility of a simple polygon
Conference-paper 1992 EN Bronze
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…
8
Citations
23
References
1
Authors
0.88
FWCI
Topics
Keywords
Authors & Affiliations
1 authors| # | Author | Institutions | ORCID |
|---|---|---|---|
| 1 | Danny Z. Chen Corresponding | Purdue University West Lafayet… (US) |
Related Works
10Data: OpenAlex