Minimum Coverage by Convex Polygons: The CG:SHOP Challenge 2023
We give an overview of the 2023 Computational Geometry Challenge targeting the problem Minimum Coverage by Convex Polygons, which consists of covering a given polygonal region (possibly with holes) by a minimum number of convex subsets, a problem with a long-standing tradition in Computational Geom...
Zapisane w:
| Główni autorzy: | , , , |
|---|---|
| Format: | Artigo |
| Język: | Inglês |
| Wydane: |
Wolfgang Mulzer
2026-02-01
|
| Seria: | Computing in Geometry and Topology |
| Dostęp online: | https://www.cgt-journal.org/index.php/cgt/article/view/115 |
| Etykiety: |
Nie ma etykietki, Dołącz pierwszą etykiete!
|