Search results
14 godz. temu · To get what I want , I think the first step should rearrange the vertices as these vertices are stored randomly in a vector; then calculate the distance between the ith vertex and i+1th vertex, and filter the vertices that are too close. But I dont know how to implement these. Or if you have a better algorithm, could you help me solve this issue.