title: Find bounds of voronoi diagram that results equal area regions
body: <p>I have voronoi diagram that contains 4 sites:
  <a href="https://i.stack.imgur.com/RApVP.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/RApVP.png" alt="enter image description here" /></a></p>
  <p>I am trying to find bounds <code>B</code> that would divide my voronoi regions into equal areas or close as possible. The only requirement here is that <code>B</code> would have constant aspect ratio <code>c</code>. In other words <code>B</code> width divided with height would always result to <code>c</code> (<code>c = width/height</code>).
  <a href="https://i.stack.imgur.com/Xshu5.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/Xshu5.png" alt="enter image description here" /></a></p>
  <p>Images here as example I am looking for general solution that would work on any 4 sites. I plan to use this solution on software realtime with constantly changing sites, so it is preferred it would not require huge number of iterations.
  I am curious is there any algorithm to solve this issue. So far I tried:</p>
  <ul>
  <li>Floyd relaxation, that is used to find equal area regions, but it modifies sites.</li>
  <li>Reinforced learning, could not get anything relevant out of it.</li>
  <li>Managed to solve it for 3 sites, but that did not scaled well to 4 sites.</li>
  </ul>