Welzl's algorithm for smallest enclosing disk
E2172221
UNEXPLORED
Welzl's algorithm for smallest enclosing disk is a randomized, incremental computational geometry algorithm that efficiently computes the minimum enclosing circle of a set of points in expected linear time.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Welzl's algorithm for smallest enclosing disk canonical | 1 |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.