Delaunay triangulator

Delaunay triangulator

Released 4 years ago , Last update 4 years ago

Delaunay triangulator class in C++

Questions & Comments


Or enter your name and Email
  • SJ Simon Jackson 2 years ago
    Will this generate Voroni diagrams?
  • GC Graeme Cox License holderPersonal License
    Purchased on Mar 9, 2012
    3 years ago
    Hi. Im looking for some code to triangulate some large terrain models with over 300,000 points. How long does your code take to triangulate say 300,000 points?
    • vincenzo panella Publisher 3 years ago
      The Delaunay triangulation complexity is O(n⌈d / 2⌉) where n is the number of points and d is the dimension , in this case d= 2 so you have O( n ), which is linear complexity. I think that triangulating 300,000 points would take approxx 2 mins.
    • GC Graeme Cox 3 years ago
      OK. Sounds good. Have you tested O( n ), which is linear complexity? Sounds a bit good to be true..
    • vincenzo panella Publisher 3 years ago
      I am not inventing anything, complexity theory is well known for triangulator, to be sure , before replying, i have just checked in one of my books.
  • JD Jason Dunn License holderPersonal License
    Purchased on Oct 7, 2011
    3 years ago
    Great code that works as expected. It quickly triangulates 500+ points, removing duplicates and retaining original point indicies. Easier to use than Triangle in a c++ app and is a low-cost alternative for a commercial application.
You need to log-in or create an account
  • Create an account
  • Log-in
Please use your real name.
Activation link will be sent to this address.
Minimum 8 characters
Enter your password again

Clicking this button confirms you read and agreed to the terms of use and privacy policy.

X

Save your watchlist

Fill your details below to receive project updates from your watch list - including new versions, price changes and discounts.

I agree to the terms of use and privacy policy.