close
Given a set of connected points, where they are filled with red color.
And we arrange these points in a rectangle and those blue points are down-sampled points of them.
If we move one of blue points, how do we update those neighborhood of it?
1. first, find the neighborhood points that are close enough to pt1, in which their Eucliden distances to Pt1 should be less than ε
2. calculate the movement between Pt1 and Pt1’, and name it as D
3. adjust the positions of those neightborhood points, and the size of movement is equal to ||Pts(k)-Pt1|| divided byε, and multiplied by D
Another case: given a set of points in an arc
全站熱搜
留言列表
