Back

Farthest-first traversal / greedy permutation: generate a sequence of points, choosing each one to be as far as possible from already chosen points. Its first k points form good cluster centers (approximating min-max-diameter or min-max-radius clustering) and are well separated (approximating max-min distance). Its applications include halftoning, color quantization, sensor network distribution, and underwater robot task planning. https://en.wikipedia.org/wiki/Farthest-first_traversal, now another Wikipedia Good Article.