0

The problem I am facing is as follows. Suppose we have a unit square and we have been given certain no. of finite points, n (For eg n=5) which are randomly spread in the square. Now, we want to partition the square into n convex parts (n=5 here) using these points. So, how can we proceed further? I am stuck at this point - any help will be appreciated.

Edit: Using these points refer to "voronoi diagram". What I am seeking here is an algorithm that could be implemented in matlab to find such regions.

Alex Ravsky
  • 90,434
Madhusudana
  • 308
  • This is rather vague---what exactly does "using these points" mean? Do you mean, e.g., using a Voronoi diagram? http://en.wikipedia.org/wiki/Voronoi_diagram – Travis Willse May 24 '15 at 09:46
  • What do you mean with "using" the points? – ajotatxe May 24 '15 at 09:46
  • Where does this problem come from? That might help us get some idea what you want to achieve. – Henrik supports the community May 24 '15 at 09:55
  • 1
    If you just want an implementation, Matlab already includes a "voronoi" function that computes the regions (and optionally plots them). The code is commented if you want to understand what it's doing. – p.s. May 24 '15 at 22:15

0 Answers0