문제

I have computed a Delaunay triangulation using DelaunayTri() in Matlab R2010b. Now I would like to burn a subset of the triangles (i.e. 12200 triangles) into a matrix (Raster). Is there any fast/efficient way of doing this?

I have tried using both poly2mask() and inpolygon() to select pixels inside the triangles, but this is rather slow.

도움이 되었습니까?

해결책

I implemented this fast solution:

qrypts=[xgridcoords, ygridccords]; %grid x and y coordinates
triids = pointLocation(dt, qrypts); %associate each grid point to its Delaunay triangle
Lia = ismember(triids,dtsubset); %keep subset of points contained in the desired triangles (dtsubset contains the indices of desired triangles)
IM=false(size(grid)); 
IM(Lia)=1;
라이센스 : CC-BY-SA ~와 함께 속성
제휴하지 않습니다 StackOverflow
scroll top