Welcome, Guest. Please login or register. Did you miss your activation email?

Author Topic: Delaunay tringulation  (Read 5215 times)

0 Members and 1 Guest are viewing this topic.

frapa

  • Newbie
  • *
  • Posts: 7
    • View Profile
    • Frapa website
    • Email
Delaunay tringulation
« on: August 14, 2012, 12:14:53 pm »
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

  • Administrator
  • Hero Member
  • *****
  • Posts: 32498
    • View Profile
    • SFML's website
    • Email
Re: Delaunay tringulation
« Reply #1 on: August 14, 2012, 12:23:09 pm »
Doesn't boost have all this stuff (in graph or geometry)?

Quote
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 ;)
Laurent Gomila - SFML developer

eXpl0it3r

  • SFML Team
  • Hero Member
  • *****
  • Posts: 11037
    • View Profile
    • development blog
    • Email
Re: Delaunay tringulation
« Reply #2 on: August 14, 2012, 01:41:06 pm »
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?
Official FAQ: https://www.sfml-dev.org/faq.php
Official Discord Server: https://discord.gg/nr4X7Fh
——————————————————————
Dev Blog: https://duerrenberger.dev/blog/

Nexus

  • SFML Team
  • Hero Member
  • *****
  • Posts: 6287
  • Thor Developer
    • View Profile
    • Bromeon
Re: Delaunay tringulation
« Reply #3 on: August 14, 2012, 03:58:21 pm »
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...
Zloxx II: action platformer
Thor Library: particle systems, animations, dot products, ...
SFML Game Development:

Klaim

  • Full Member
  • ***
  • Posts: 137
    • View Profile
Re: Delaunay tringulation
« Reply #4 on: August 14, 2012, 06:46:01 pm »
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

  • Newbie
  • *
  • Posts: 7
    • View Profile
    • Frapa website
    • Email
Re: Delaunay tringulation
« Reply #5 on: August 14, 2012, 07:26:14 pm »
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...

 

anything