Unit hypercube encodings Posted by Chad Brewbaker, at cstheory.stackexchange.com, 05 Jan 2017 How can we chose to place $k$ points in $[0,1]^d$, such that the minimum Euclidian distance between any two points is maximized?