Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses (Q1921619)
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 921598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses |
scientific article; zbMATH DE number 921598 |
Statements
Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses (English)
0 references
27 October 1996
0 references
covering of plane domains
0 references
prescribed number of ellipses
0 references
optimization algorithms
0 references
0.8182662725448608
0 references
0.8115925192832947
0 references
0.8016434907913208
0 references
0.7928852438926697
0 references
