Also known as minimum covering circle problem
mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane
via Wikidata · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).