Npumcm selection question 3 and acmc2020a

One person skipped class for two days and finished it
I did some homework in the middle
Then finish the thesis and optimization at the weekend ...

To put it bluntly, it means filling ...
It seems that the main difficulty lies in programming calculation
Make the most of it matlab Of polyshape

Loop fill

The main use of polybuffer function , The principle of this function is to find the union , And then calculate it layer by layer
But the operation speed is relatively slow
Core code

  while ~isempty(polyout.Vertices)% Null intersection terminates the loop 
        polyout=polybuffer(polyshape(polyout.Vertices(1:end,1:2)),-m);
        out(i+1).num=polyout.Vertices;
        i=i+1;
   end

Judge whether to terminate the loop when the generated point set is empty

Parallel line fill

This one is filled with a ring , Get new polyshape Object and parallel lines with equal spacing from top to bottom bool Operation function
Core code

    for i=1:round((1/m)*round(abs(low(1,2))+upper(1,2)))
       line(i).num=[low(1,1),low(1,2)+m*(i-1);upper(1,1),low(1,2)+m*(i-1)];
   
       [inLine(i).num,outLine(i).num] = intersect(polyshape(area),line(i).num);
%     plot(inLine1_2(i).num(:,1),inLine1_2(i).num(:,2),'b')% It's strange to paint blue ..
%     plot(inLine1_2(i).num(:,1),inLine1_2(i).num(:,2),[mod(i,1),mod(i,2),mod(i,3)])
   
   end

Then we will make two groups , Because all the data obtained are endpoint data xy coordinate , In the middle of the NaN It means to disconnect
Finally, calculate the connection length of each group
How to connect different groups , I don't know much about this , If there is a meeting, please give me some advice

Generally speaking, not too many algorithms are involved , But the speed of calculation is so slow , My level is limited qwq, To review for the exam + Learning new things

---

Just thought of how to connect , It can be connected in sections, left and right , Because the order is fixed