Snowball algorithms for minimal disk and maximal distance - Archive ouverte HAL
Pré-Publication, Document De Travail (Preprint/Prepublication) Année : 2023

Snowball algorithms for minimal disk and maximal distance

Résumé

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.
Fichier principal
Vignette du fichier
Two snowball algorithms.pdf (749.7 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04017052 , version 1 (06-03-2023)

Identifiants

  • HAL Id : hal-04017052 , version 1

Citer

Alain Marchand. Snowball algorithms for minimal disk and maximal distance. 2023. ⟨hal-04017052⟩

Collections

CNRS
44 Consultations
71 Téléchargements

Partager

More