Given are a number of control points $c_i$ and a point $p$ (all in cartesian 3D space). $i$ may be anywhere between 8 and roughly 200. The point $p$ can be written as a convex combination of $c_i$: \begin{equation} p = \sum_i w_i c_i \end{equation} given the constraints that $\sum w_i = 1$ and $0 \leq w_i \leq 1$ (for all $i$).
I would like to find a set of weights $w_i$. Since I suppose there are infinitely many solutions to this, I would like to find an intuitive solution (whatever that means, exactly) - maybe one that keeps the weights as evenly distributed as possible.
How would I find those weights?