CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

Maybe this is doing what you want:
https://github.com/sloriot/cgal-voronoi-cropping

Given a set of points and a bounding box, you get a HDS
containing the Voronoi diagram of your input points
cropped to the bounding box.

See the example:
https://github.com/sloriot/cgal-voronoi-cropping/blob/master/test/main.cpp

HTH,

Sebastien.



On 07/12/2016 04:01 PM, Pol Monsó Purtí wrote:
> I'd like to retrieve the polygons made of the voronoi bissectors or, at
> least, the bounding box of each voronoi region. That is, extracting the
> connected components of a voronoi diagram.
>
> I'm struggling to see which of the iterators is appropriate and wether
> the funcionality is already in cgal's voronoi diagram.
>
> Another way of seeing it is retrieving it all the voronoi vertices that
> concern each site, with their order for the polygon or without for the
> bounding box.
>
> I am not sure which iterator to use or if there's one that already
> circulates around the voronoi vertices of a site. I couldn't find it
> from the documentation.
>
> The diagram is in 2D.
>
> My definitions:
>
>
> typedef  CGAL::Exact_predicates_inexact_constructions_kernel  K;
>
> typedef  CGAL::Projection_traits_xy_3<K>   Gt;
>
> [...]
> //cgalvoronoi
>
> typedef  CGAL::Delaunay_triangulation_2<Gt>                                   
>  DT;
>
> typedef  CGAL::Delaunay_triangulation_adaptation_traits_2<DT>                 
>  AT;
>
> typedef  CGAL::Delaunay_triangulation_caching_degeneracy_removal_policy_2<DT> 
>  AP;
>
> typedef  CGAL::Voronoi_diagram_2<DT,AT,AP>                                    
>  VD;