I would like to maximize the minimum spacing between a fixed number of points ($x_i \in \mathbb{R}^2$) placed inside a polygon in the plane. The minimum spacing includes distance to the polygon.

Thus, I am trying to solve $$ \max_{x_i,R} R \\ s.t. \quad ||x_i -x_j||_2 \geq R, \quad \forall\ i \neq j \\ a_k^Tx_i + R||a_k||_2 \leq b_k, \quad \forall\: i,k\\ Ax_i \leq b, \quad \forall \: i $$

However, the first set of constraints are not convex. Is there any known relaxation or approximation for this problem?


1 Answer 1


This is a fairly complex variant of the circle packing problem (just google it): in that case you are given $n$ circles of the same radius $R$ and you want to determine the maximal $R$ and their center position so that they do not overlap and stay in a unitary square.

Is is a non convex quite hard problem. Yours sounds even harder. There are some convex relaxations but usually quite loose. For instance you might look to a series of paper from KM Anstreicher about SDP relaxations.

  • 1
    $\begingroup$ Agreed. I've actually tried models like this using convex SDP-based relaxations. They don't work. :-) $\endgroup$ Mar 20, 2014 at 20:10
  • $\begingroup$ Ah, for some reason I thought the circle-packing problem was maximizing $n$ given fixed $R$ and that this would be somewhat different, but I guess not. $\endgroup$
    – Ross B.
    Mar 22, 2014 at 18:43

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.