CodePudding user response:
L is the subscript p [l]So to understand
Int l=1;
While (l<=n - 3)
{
To determine the p [l];
L++;
};
Voronoi polygon convex hull is probably already? Not written as shown in figure 9.5, you look at the bai
This algorithm is not himself wrote just know
CodePudding user response:
Ok, thanks, I'm in and have a look