A new algorithm for the largest empty rectangle problem (Q582097)
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: Publication:582097 |
scientific article; zbMATH DE number 4130017
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for the largest empty rectangle problem |
scientific article; zbMATH DE number 4130017 |
Statements
A new algorithm for the largest empty rectangle problem (English)
0 references
1990
0 references
computational geometry
0 references
largest empty rectangle problem
0 references
computational complexity
0 references
0.9185256361961364
0 references
0.9163998961448668
0 references
0.909515380859375
0 references
0.9044138193130492
0 references
