Personal License $10.99

1 application Binary restricted distribution Commercial use allowed Can modify source Read full license | More Info

Personal License $24.99

Unlimited projects Source and binary distribution Commercial use allowed Can modify source Read full license | More Info

You need to log-in or create an account
  • Create an account
  • Log-in
  • Please use your real name.
  • Account activation link will be sent to this address.
  • Minimum 8 characters

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

Starting from $ 10.99

View Pricing 14 days money-back guarantee
(1 ratings)

Delaunay triangulator

Delaunay triangulator class in C++

Share and win up to $15k in prizes each month!Learn more

Share

Description

Delaunay triangulation is a fundamental algorithm which has a vast range of applications, both in game development and in other research areas, such as AI and graph theory.

Many libraries include this algorithm among their functions , but they require adding many include files or link to big dll libraries just for getting the functions needed to run the algorithm. In many cases this is not a viable option.

This Delaunay triangulation class is contained in a single include file and it triangulates a set of unordered points in 2D space in the fastest way possible. In addition, the adjacency of each triangle is computed and redundant vertices are discarded.The algorithm used is the flip algorithm in a divide and conquer fashion.

What our users say:

"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." - Jason Dunn

An example of usage is shown below:

// first , define some random points in 2d space

double Px[1024],Py[1024];

int N=10;

for ( int i=0; iSelectObject(&penBlue);

       // and a solid red brush
       CBrush brushRed(RGB(155, 155, 155));
       CBrush* pOldBrush = pDC->SelectObject(&brushRed);

       // Find the midpoints of the top, right, left, and bottom
       // of the client area. They will be the vertices of our polygon.

       pts[0].x = (int)VertexPtr[ p1 ].x;
       pts[0].y = (int)VertexPtr[ p1 ].y;

       pts[1].x = (int)VertexPtr[ p2 ].x;
       pts[1].y = (int)VertexPtr[ p2 ].y;

       pts[2].x = (int)VertexPtr[ p3 ].x;
       pts[2].y = (int)VertexPtr[ p3 ].y;

       // Calling Polygon() on that array will draw three lines
       // between the points, as well as an additional line to
       // close the shape--from the last point to the first point
       // we specified.

       pDC->Polygon(pts, 3);

       // Put back the old objects.

       pDC->SelectObject(pOldPen);
       pDC->SelectObject(pOldBrush);

    }

    for ( i=0; i

// if you want to draw the adjacent triangle just use these lines of code

            j=0;   // we want adjacent traingles to triangle number 0

int p12;

p12=TrianglePtr[ j ].t1;

if ( p12!=-1)   DrawPoly( pDC , p12 ,col2 );

p12=TrianglePtr[ j ].t2;

if ( p12!=-1)   DrawPoly( pDC , p12 ,col1 );

p12=TrianglePtr[ j ].t3;

if ( p12!=-1)   DrawPoly( pDC , p12 ,col3 );
Read all 8 comments »

Questions & Comments

Leave a comment

You must be logged-in to leave a comment.
Log-in now or register for a free account.
  • vincenzo panella Author said:

    9 months ago
    This library doesn't generates voronoi diagrams, its just the traingulator.
  • Simon Jackson said:

    9 months ago
    Will this generate Voroni diagrams?
  • Graeme Cox License holder?Personal License said:

    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?
    • vincenzo panella Author said:

      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.
    • Graeme Cox License holder?Personal License said:

      1 year ago
      OK. Sounds good. Have you tested O( n ), which is linear complexity? Sounds a bit good to be true..
    • vincenzo panella Author said:

      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.
You must be logged-in to vote. Log-in to your account or register now.
View all 1 reviews »

User Reviews

Starting from $ 10.99

View Pricing 14 days money-back guarantee