Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge) (Q6060047)
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: Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge) |
scientific article; zbMATH DE number 7760212
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge) |
scientific article; zbMATH DE number 7760212 |
Statements
2 November 2023
0 references
convex partition
0 references
randomized local search
0 references
planar point sets
0 references
Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge) (English)
0 references
0.9684084
0 references
0.94476867
0 references
0.8787347
0 references
0.8738445
0 references
0.8561152
0 references
0.8548677
0 references
0.8528366
0 references
0.8522625
0 references
0.85148335
0 references
0.85014486
0 references
