An O(log log n) time algorithm to compute the kernel of a po…
Emerging
0
Citations0
Refs1994
Year
Search Works
Work Details
- DOI 10.5555/640160.640165
- OpenAlex ID W3004757106
- Type Article
- Language EN
- Published 01 Dec 1994
- Source Nordic journal of computing
- Added 10 Oct 2025
- Updated 12 Oct 2026
External Links
MENU
0
An O(log log n) time algorithm to compute the kernel of a polygon
Article 1994 EN
The kernel of a polygon P is the set of all points that see the interior of P. It can be computed as the intersection of the halfplanes that are to the left of the edges of P. We present an O(log l...
0
Citations
0
References
1
Authors
0.00
FWCI
Topics
Keywords
Authors & Affiliations
1 authors| # | Author | Institutions | ORCID |
|---|---|---|---|
| 1 | SchuiererSven Corresponding | — | — |
Related Works
20Data: OpenAlex