CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

You can try this package which simulate a halfedge data structure to 
represent the diagram:
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Voronoi_diagram_2/Chapter_main.html

If you need the diagram to be explicitely built, I have experimental
code that creates a hds and crop a Voronoi diagram to a rectangle [1].
It should work for a power diagram too.
Look at main.cpp in test directory.

Sebastien

[1] http://code.google.com/p/cgal-voronoi-cropping/

On 04/19/2013 09:13 AM, liudaisuda wrote:
> Hey, guys. I am new to CGAL and didn't find any documentation to my question
> below. Thanks in advance for you kind help.
>
> I am trying to generate a bounded power diagram which could simply be done
> by clipping the Power diagram with the boundary. However, this is not what I
> am seeking. I need to compute for each power diagram cell within the
> boundary the centroid. I could store each clipped power diagram cell in a
> convex polygon structure, and then compute its centroid, but with this
> approach I will have to build the power diagram from scratch, and thus make
> no use of the nice features provided by CGAL. My question is, if is there
> any way I can use structures such as constrained Delaunay Triangulation to
> tackle this problem?
>
>
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Bounded-Power-Diagram-tp4657223.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.