Delaunay tringulation

[frapa]

It's a year that I think of creating a map generator using voronoi diagrams and delaunay triangulations. Do you know any library which can compute the delaunay triangulation for a set of point, or that has an implementation of a quad-edge data structure. I'm interested also in a generic graph library.

I've seen that thor (from nexus) can compute delaunay triangulations but i cannot make it work properly.

I've also seen Lemon, which offers a nice graph implementation.

[Laurent]

Doesn't boost have all this stuff (in graph or geometry)?

I've seen that thor (from nexus) can compute delaunay triangulations but i cannot make it work properly.

I'm sure that whatever problem you have with Thor can be solved easily if you ask

[eXpl0it3r]

I've seen that thor (from nexus) can compute delaunay triangulations but i cannot make it work properly.

Have you taken a look at the example for triangulation?

[Nexus]

In my opinion, Boost.Graph is a badly documented and over-generalized mess, LEMON is really much more user-friendly. And the fact that Boost didn't provide a certain graph algorithm made my choice definite. Boost.Geometry looks slightly better structured than Boost.Graph, but I have never really used it yet.

Concerning Thor's triangulation, I wrote you a PM saying that you should send me an example reproducing your problem. You have not answered...

[Klaim]

Doesn't boost have all this stuff (in graph or geometry)?

There was a proposal in Boost.Geometry but i dont' see it in the current doc.

[frapa]

Concerning Thor's triangulation, I wrote you a PM saying that you should send me an example reproducing your problem. You have not answered...

I'm studying your example to understand it better. When I'll have sometime and if things don't work I'll send you an example.

I did't like boost.graph either... I always find boost documentation terrible. LEMON looks much better to me, but it does not support dual graph for what I know...