Placing two axis-parallel squares to maximize the number of enclosed points (Q2792797)
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: Placing two axis-parallel squares to maximize the number of enclosed points |
scientific article; zbMATH DE number 6555264
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Placing two axis-parallel squares to maximize the number of enclosed points |
scientific article; zbMATH DE number 6555264 |
Statements
14 March 2016
0 references
maximal enclosing problem
0 references
\(k\)-enclosing problem
0 references
computational geometry
0 references
staircase
0 references
dynamic programming
0 references
0.8837547
0 references
0.86888754
0 references
0 references
0.86683327
0 references
0.86683327
0 references
0.86667025
0 references
0.8643063
0 references
0.8627306
0 references
Placing two axis-parallel squares to maximize the number of enclosed points (English)
0 references
