Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes (Q1274552)
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 1238469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes |
scientific article; zbMATH DE number 1238469 |
Statements
Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes (English)
0 references
12 January 1999
0 references
line drawings
0 references
computational complexity
0 references
random polyhedral scenes
0 references
0 references
0.8237726092338562
0 references
0.7982104420661926
0 references
0.7857950329780579
0 references
0.7727513909339905
0 references
0.7684209942817688
0 references
