Personal License

  • Perpetual license (does not expire)
  • 1 application
  • Can distribute binary products only
  • Commercial use allowed
$10.99 Read License

Personal License

  • Perpetual license (does not expire)
  • Unlimited projects
  • Can distribute code and binary products
  • Commercial use allowed
$24.99 Read License

14 Day money-back guarantee

Full refund within 14 days of purchase date.

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.

Delaunay triangulator

Delaunay triangulator
Developed by vincenzo panella, Released Jun 23, 2011

Delaunay triangulator class in C++

C/C++

Tags: 2d , fast , game , path finding

View Licenses $10.99+

Activity

Total 8 comments
Posted by 4 people

Related components

Sky Sphere / Cube / Dome Render FREE
Delaunay + Voronoi diagram generator FREE
Dynamic Mesh FREE
More C/C++ components

Questions & Comments

You must be logged-in to vote. Log-in to your account or register now.

Or enter your name and Email
  • vincenzo panella Developer 10 months ago
    This library doesn't generates voronoi diagrams, its just the traingulator.
    Reply Flag
  • Simon Jackson 10 months ago
    Will this generate Voroni diagrams?
    Reply Flag
  • Graeme Cox License holderPersonal License 1 year 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?
    Reply Flag
    • vincenzo panella Developer 1 year 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.
      Reply Flag
    • Graeme Cox License holderPersonal License 1 year ago
      OK. Sounds good. Have you tested O( n ), which is linear complexity? Sounds a bit good to be true..
      Reply Flag
    • vincenzo panella Developer 1 year 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.
      Reply Flag
  • Jason Dunn License holderPersonal License 2 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.
    Reply Flag