Shadoks approach to convex covering (CG challenge) (Q6620567)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7927924
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shadoks approach to convex covering (CG challenge) |
scientific article; zbMATH DE number 7927924 |
Statements
Shadoks approach to convex covering (CG challenge) (English)
0 references
16 October 2024
0 references
A new heuristic algorithm for the problem of covering a polygon with holes \(P\) using a small set of convex polygons that lie inside \(P\) is proposed. Results of some numerical experiments with this algorithm are given.\N\NThe algorithm won the second place in the Geometric Optimization Challenge CG:SHOP 2023.\N\NFor the entire collection see [Zbl 1518.68009].
0 references
set cover
0 references
covering
0 references
polygons
0 references
convexity
0 references
heuristics
0 references
enumeration
0 references
simulated annealing
0 references
integer programming
0 references
computational geometry
0 references
0.8369919657707214
0 references
0.7647104263305664
0 references
0.756793737411499
0 references
0.7419872879981995
0 references
0.7263889908790588
0 references
