CGAL users discussion list

[Sebastian Kürten <>]

Hello,

I'm working on a universitary student's software project here and am
trying to understand the way the Apollonius/Voronoi API of CGAL is
meant to be used.

I would like to create a Apollonius diagram. Basically I adapted the
examples and am currently using
 * a Simple_cartesian kernel
 * Apollonius_graph_filtered_traits_2 as Traits for Apollonius
 * Apollonius_graph_vertex_base_2 as a Vertex base
 * Triangulation_face_base_2 as a Face base
 * Triangulation_data_structure_2 as a AGDS

I can successfully create an Apollonius graph and the visualization
adapted from the demo package shows correct construction. Now I'm using
the Voronoi_diagram_2 with
 * Apollonius_graph_adaptation_traits_2 as Adaption traits
 * Apollonius_graph_degeneracy_removal_policy_2 as Degeneration Policy
to construct the corresponding dual voronoi diagram.

I would like to examine the resulting geometric objects in detail. So
for example I would like to have access to the bisectors of the cells
of the weighted voronoi diagram:
From the VoronoiDiagram I can get an iterator for its faces via
'faces_begin()' and from each face I can get access to its edges as a
DCEL via 'halfedge()'. Each edge provides source and target vertex
if available, so that I know about start- and endpoint of each bisector.

Now, what I do not understand here is how to retrieve the full
information about each bisector. Because somehow one should be able to
get information about the exact course of each bisector, which is
usally not a straight line but a hyperbola or parabola instead. Could
someone give me a hint about how to get this information?

Thank you
Sebastian Kürten