Computing low-cost convex partitions for planar point sets based on tailored decompositions (CG challenge) (Q6060050)
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 7760214
| 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 tailored decompositions (CG challenge) |
scientific article; zbMATH DE number 7760214 |
Statements
2 November 2023
0 references
computational geometry
0 references
geometric optimization
0 references
algorithm engineering
0 references
convex decomposition
0 references
0.8363857269287109
0 references
0.8362361788749695
0 references
0.8026837110519409
0 references
0.776970624923706
0 references
0.7723607420921326
0 references
