A faster dual algorithm for the Euclidean minimum covering ball problem (Q6880176)
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 8139992
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster dual algorithm for the Euclidean minimum covering ball problem |
scientific article; zbMATH DE number 8139992 |
Statements
A faster dual algorithm for the Euclidean minimum covering ball problem (English)
0 references
19 December 2025
0 references
minimum covering ball
0 references
smallest enclosing ball
0 references
1-center
0 references
minmax location
0 references
computational geometry
0 references
0 references
