CGAL users discussion list

[Stefan Salewski <>]

Hello,

I am using CGAL for creation of the initial constrained delaunay
triangulation for a experimental topological pcb router.

I wrote some minimal bindings for Ruby -- so I can insert vertices and
constraints, iterate over all edges, find all neighbor vertices of a
vertex. (Even rage search seems to work, but I have already replaced it
with bindings for BOOST RTREE.) Basically that is all what I need.

But it would be nice to find all the vertices inside of the constrained
polygons. I made this sketch:

http://www.ssalewski.de/tmp/T.png

Red are the polygons built from constrained edges, and I want to find
the blue edges. (I am doing a Dijkstra shortest path search along the
edges, the constrained polygons are obstacles.)

I found this example,
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Triangulation_2/Chapter_main.html#Subsection_37.8.2
but currently I have not really an idea how I can use it to find the
edges in polygons.

Best regards,

Stefan Salewski