CGAL users discussion list

[Olivier Devillers <>]

 a écrit :
> Hey.
> Thanks for taking interest.
> As the usual Voronoi Tessellation is defined, a 2D space is divided into n
> regions according to n-sites. Now, suppose instead of the underlying 2D space,
> you have a list of 2D points that you need to distribute among the n sites. 
> So,
> the final result would be pretty familiar, i.e., for example, if a point i
> occurs in the continuous Voronoi region of site k, then here, in the discrete
> case, it would alloted to site k. Basically, each point needs to be to its
> closest site.
>
> So, I just wanted to know whether such an implementation would be there in
> CGAL.
>
> Thank you.
> Hope you can help.
>   
so just compute the usual Delaunay triangulation of the sites
(e.g. using the vertex with info to add a list or any suitable data 
structure to store points to each site)

Then ask for the nearest neighbor of all your points !