Corner cuts are close to optimal: from solid grids to polygons and back (Q1949103)
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 6157660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Corner cuts are close to optimal: from solid grids to polygons and back |
scientific article; zbMATH DE number 6157660 |
Statements
Corner cuts are close to optimal: from solid grids to polygons and back (English)
0 references
25 April 2013
0 references
min-cut
0 references
\(m\)-cut
0 references
bisection
0 references
corner cuts
0 references
grid graphs
0 references
polygons
0 references
0 references
0 references
0.8837307095527649
0 references
0.8293145895004272
0 references
0.7459748983383179
0 references
0.7252436280250549
0 references
