Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Voronoi-/Power- diagram 3D

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Voronoi-/Power- diagram 3D


Chronological Thread 
  • From: Bernhard Kornberger <>
  • To:
  • Subject: Re: [cgal-discuss] Voronoi-/Power- diagram 3D
  • Date: Wed, 01 Aug 2007 09:37:05 +0200


schrieb:
Bernhard Kornberger wrote:

I need to traverse the edges of a 3d power diagram. But
as far as I see there is only the possibility to compute
the dual of single elements of the regular triangulation
bit by bit.

right

Is it true that I have to implement the conversion from
the power diagram to a graph of the power diagram by myself
or is there already a function that I didn't find?

The graph is dual to the triangulation (up to degeneracies), do you need to convert the triangulation to its dual that you would store in addition ?

Monique

Right. I need a function like this:

Regular_triangulation Tr;
Tr.insert(p1);
Tr.insert(p2);
Tr.insert(p3);
Tr.insert(p4);

UndirectedGraph g=Tr.dual();

..such that I can traverse along the edges of $g afterwards.


Bestg
Bernhard




Archive powered by MHonArc 2.6.16.

Top of Page