CODEWITHSUNDEEP
matlabgeometrymeshcgaldelaunay
Jav
Jav

Reputation: 43

Resulting triangles are delaunay or not from incremental delaunayTriangulation in MATLAB

salam i have a delaunay triangulation from 30,000 points (x,y) using DelaunayTriangulation in MATLAB,now i have to add 100 more points(x,y) stored in h(i,j), Using these lines of code

for i=1:100
tri.Points(end+1,:)=h(i,:)
end

i have tried to figure out but i am not sure that the algorithm that runs behind the DelaunayTriangulation command in MATLAB inserts the new points by first removing the old connections and ensures that after addition of the new points the triangulation remains delaunay or i have to write the code my self for this

Upvotes: 0

Views: 302

Answers (1)

lrineau
lrineau

Reputation: 6274

The 2D/3D Delaunay triangulations of Matlab use the CGAL libraries. In CGAL, the data structure of 2D and 3D triangulations are dynamic, and the insertion of new points in a Delaunay triangulation automatically updates the connectivity to ensure the Delaunay property of all simplexes (triangles and tetrahedra). I do not know the details of the implementation of Matlab, but it probably follows the same principles.

Upvotes: 1

Related Questions