Fast algorithms for computing the smallest \(k\)-enclosing circle (Q1763156)
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: Fast algorithms for computing the smallest k-enclosing circle |
scientific article; zbMATH DE number 2135864
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for computing the smallest \(k\)-enclosing circle |
scientific article; zbMATH DE number 2135864 |
Statements
Fast algorithms for computing the smallest \(k\)-enclosing circle (English)
0 references
21 February 2005
0 references
0.9528573751449584
0 references
0.9011611938476562
0 references
0.9005625247955322
0 references
0.8992260694503784
0 references
0.8943684697151184
0 references
