delaunay triangulation script for adobe illustrator

If rect_contains(r, pt1) and rect_contains(r, pt2) and rect_contains(r, pt3) :Ĭv2.line(img, pt1, pt2, delaunay_color, 1, cv2.CV_AA, 0)Ĭv2.line(img, pt2, pt3, delaunay_color, 1, cv2.CV_AA, 0)Ĭv2.line(img, pt3, pt1, delaunay_color, 1, cv2.CV_AA, 0)

Mat img_voronoi = Mat::zeros(img.rows, img.cols, CV_8UC3) Ĭv2.circle( img, p, 2, color, cv2.cv.CV_FILLED, cv2.CV_AA, 0 )ĭef draw_delaunay(img, subdiv, delaunay_color ) : Subdiv.getVoronoiFacetList(vector(), facets, centers) įor( vector::iterator it = points.begin() it != points.end() it++)ĭraw_delaunay( img_copy, subdiv, delaunay_color ) ĭraw_delaunay( img, subdiv, delaunay_color ) Static void draw_delaunay( Mat& img, Subdiv2D& subdiv, Scalar delaunay_color )

Static void draw_point( Mat& img, Point2f fp, Scalar color )Ĭircle( img, fp, 2, color, CV_FILLED, CV_AA, 0 ) ) and continue until there are no triangles whose circumcircle contains a point.Īny discussion on Delaunay triangulation has to include Voronoi diagrams because the Voronoi diagram of a set of points is mathematical dual to its Delaunay triangulation. If it does, flip the edges ( as show in Figure 2. The most obvious ( but not the most efficient ) one is to start with any triangulation, and check if the circumcircle of any triangle contains another point. There are many algorithms to find the Delaunay triangulation of a set of points. On the other hand in the bottom image, the angle BCD is too large, and Delaunay triangulation creates an edge AC to divide the large angle. In the top image angles ABC and ABD are large, and Delaunay triangulation creates an edge between B and D splitting the two large angles into smaller angles ABD, ADB, CDB, and CBD. In the top image, the points B and D have their x-coordinates at x = 1.5, and in the bottom image they are moved to the right to x = 1.75. triangles with one large angle ).įigure 2 shows how the triangulation changes to pick “fat” triangles when the points are moved. In the top image, for the triangulation to be a valid Delaunay triangulation, point C should be outside the circumcircle of triangle ABD, and point A should be outside the circumcircle of triangle BCD.Īn interesting property of Delaunay triangulation is that it does not favor “skinny” triangles ( i.e. shows Delaunay triangulation of 4 points A, B, C and D. In a Delaunay triangulation, triangles are chosen such that no point is inside the circumcircle of any triangle. A set of points can have many possible triangulations, but Delaunay triangulation stands out because it has some nice properties. In Figure 1, we see a set of landmarks on the left image, and the triangulation in the middle image.

Given a set of points in a plane, a triangulation refers to the subdivision of the plane into triangles, with the points as vertices. Figure 2 : Delaunay triangulation favors small angles

Delaunay triangulation script for adobe illustrator