Minimum Coverage by Convex Polygons: The CG:SHOP Challenge 2023

Sándor P. Fekete,Phillip Keldenich,Dominik Krupke,Stefan Schirra

arxiv（2023）

引用 0|浏览3

暂无评分

摘要

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 Geometry.

查看译文

关键词

convex polygons,coverage,challenge

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要