| Information | |
|---|---|
| has gloss | eng: In computational geometry, the largest empty sphere problem is the problem of finding a hypersphere of largest radius in d-dimensional space whose interior does not overlap with any given obstacles. |
| lexicalization | eng: Largest empty sphere |
| instance of | c/Geometric algorithms |
Lexvo © 2008-2026 Gerard de Melo. Contact Legal Information / Imprint