A sub-quadratic time algorithm for computing the beacon kernel of simple polygons (Q6591621)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A sub-quadratic time algorithm for computing the beacon kernel of simple polygons |
scientific article; zbMATH DE number 7900433
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sub-quadratic time algorithm for computing the beacon kernel of simple polygons |
scientific article; zbMATH DE number 7900433 |
Statements
A sub-quadratic time algorithm for computing the beacon kernel of simple polygons (English)
0 references
22 August 2024
0 references
