Snowball algorithms for minimal disk and maximal distance
Alain R. Marchand · HAL (Le Centre pour la Communication Scientifique Directe) · 2023
I introduce here two novel "snowball" algorithms. One of them very efficiently solves the problem of the minimum enclosing disk over a set of points in Euclidean space. The other algorithm addresses the question of the maximal distance between two points in a set (not necessarily Euclidean). Both algorithms tend to run in linear time in low-dimensional spaces.