Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge) (Q6060049)
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 7760213
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge) |
scientific article; zbMATH DE number 7760213 |
Statements
2 November 2023
0 references
metaheuristics
0 references
memetic algorithms
0 references
convex partition optimization
0 references
Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge) (English)
0 references
0.8666879534721375
0 references
0.8362361788749695
0 references
0.777038037776947
0 references
0.7566210031509399
0 references
0.7377218008041382
0 references
