The problem of locating p maximally dispersed points in a convex space is considered. This problem is formulated as a non-linear programming problem. It is shown that this problem, in a square, is ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback