CGAL users discussion list

[apurba das <>]

Hi Wang Hetao,

I think K-nearest neighbour algorithm can be used to cluster the outside point-set and associate each set from the cluster to a vertex of the polygon. Then construct voronoi diagram with the point set which are only the vertices of the polygon. IN this situation, more focus can be given to the polygon itself, and finally polygon can be divided maintaining the constraints.

Regards,

Apurba Das

M.Tech Computer Science

Indian Statistical Institute, Kolkata 

On Tue, Oct 16, 2012 at 9:22 AM, Wang Hetao <> wrote:

As the illsutration shows below:

<http://cgal-discuss.949826.n4.nabble.com/file/n4656044/polygon_division.jpg>

Suppose there is a polygon on the plain and a set of points outside. The
polygon should be divided into parts according to distances of points inside
it to the outside point set.
It just seems as dividing the polygon with Voronoi diagram of outside point
set. But I want to get more information:
    How many points take part in?
    Which range divided of the polygon belongs to which point?

Are there professional terms that can describe this kind of problem? Thx for
your reply!



--
View this message in context: http://cgal-discuss.949826.n4.nabble.com/How-to-divide-a-polygon-according-to-distances-to-a-point-set-tp4656044.html
Sent from the cgal-discuss mailing list archive at Nabble.com.

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://sympa.inria.fr/sympa/info/cgal-discuss