Pages

Tuesday, August 16, 2011

delaunay triangulation example in c#


This is an example demo of a Delaunay triangulation, it was invented by Boris Delaunay and  is used for making hull surfaces from single points. The downloadable .rar also has a java implementation and other stuff to study. The algorithm has a high degree order and has a few bugs when there are many points. It can be added points dynamically and circles that make triangles can be drawn as well.
Any questions post it here. Anonymous comments are enabled. this is the download link
http://fbe.am/4W7

5 comments:

  1. can you upload it again?

    ReplyDelete
    Replies
    1. I will upload it tomorrow, if was usefull to you please take some time to post a comment

      Delete
  2. I'm new to the site, but I'm very interested in your triangulation method. Does this method produce the convex hull every time? I've implemented the Bowyer-Watson algorithm, but I don't always get the true convex hull. I've also made a Graham scan implementation to get the convex hull, but I can't combine the two somehow. I'd love to take a look if you get the same results or if you've bypassed that problem.

    ReplyDelete
    Replies
    1. Hello i have uploaded again the source code, take some time to test it and quote again

      Delete
  3. Hi man! I was testing your code .. and it looks nice but if you drop there a handful of points, then place a new one and drag it around to see what happens .. it is easy to find spots where the whole thing get messed :(

    Actually I discovered that using the generate random points.. that lead me to a set of points with overlapping triangles :(

    ReplyDelete