Algorithm for optimal spacing in intervals
Sure.  A simple approach is to use binary search on the separation distance $d$: given $d$, it is easy test whether there is a way to space out $k$ points so that all are at least $d$ apart (I'll let you figure out how; if you can do it for one interval, you should be be able to do it for multiple intervals).  Then use binary search on $d$.