Fast algorithms for computing the smallest \(k\)-enclosing circle (Q1763156): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:29, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms for computing the smallest \(k\)-enclosing circle |
scientific article |
Statements
Fast algorithms for computing the smallest \(k\)-enclosing circle (English)
0 references
21 February 2005
0 references
