本文探讨了如何确定Delaunay三角剖分中的顶点是否位于其自身的Voronoi区域内。通过使用加权距离进行测试，可以判断一个顶点是否在其Voronoi区域内。如果一个顶点到自身的距离小于到其他任何顶点的距离，则该顶点位于其Voronoi区域内。
Voronoi Region
Whether a disk should be draw at the vertex of the triangulation depends on whether this vertex is in its Voronoi region or not!
How to test whether a Delaunay vertex is in its Voronoi region or not?
Use the weighted distance to test!
If a Delaunay vertex, denoted as p, is in its own Voronoi region, then the distance from p to p must be smaller than p to any other vertices. If it is not in its own Voronoi region, then the above judgement will not right. Therefore, for each vertex to test whether it is in its Voronoi region or not, we can just test all the vertices connected to it directly whether the above judgement is right or not.
Progress
Till now, my project finally has come out some result for the first step.
Next step is to deform form the first data set, point set, to the second one.
Come on!
扫一扫
1265
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
