CGAL users discussion list

[Allan Lyckegaard <>]

Hi again,

thanks for you replies.

I think I agree with Mariette - what I need is the power diagram
(weighted Voronoi diagram, Laguerre diagram, what ever you call it...).

More specific, given a set of N weighted sites in 3D, S_i=(p_i,w_i),
i=1..N, every point q in 3D space is assigned to the site that fulfills

dist(q,p_i)^2 - w_i <= dist(q,p_j)^2 - w_j, 1<j<N

This will partition 3D space into non-intersecting (though
space-filling) polyhedra.


My question is now since the regular triangulation generates these cells
how can I access them?
I repeat my knowledge on STL is limited, so any clue would be
appreciated. But if possible, please give a small piece of code or so.

Thanks again,
Allan

On Tue, 2008-08-19 at 19:53 +0200, 

 wrote:
> Appolonius
> diagram