如标题所述，我试图在简单的多边形中找到地球沃罗诺图的实现。理想情况下，它可以从Python中使用。有时将其称为最短路径Voronoi图。
它是在非convex边界多边形中包含的点的Voronoi图，其中确定Voronoi细胞的最短路径被限制为在多边形内。请注意，这与简单地用边界多边形剪切标准的Voronoi图并不相同，即在2D多边形内生成细胞。
这是夹在边界多边形上的标准Voronoi图的简单说明：
/I.sstatic.net/xxpgt.png“ alt =“在此处输入图像描述”>
，这是在多边形中生成的Geodesic Voronoi Diarram的简单说明：
遇到了四篇描述这一点的论文和一些算法来实现它：
我还找到了一个视频，该视频在多边形内移动：
理想情况下，任何实现都可以从python使用，但是任何实现都将不胜感激。
非常感谢。
As the title states, I am trying to find an implementation of the geodesic voronoi diagram in a simple polygon. Ideally it would be usable from Python. It is sometimes referred to as the shortest path voronoi diagram.
It is the voronoi diagram of points contained within a non-convex bounding polygon where the shortest paths determining the voronoi cells are constrained to be within the polygon. Note this is not the same as simply clipping a standard voronoi diagram with a bounding polygon, - the cells are generated within a 2D polygon.
This is a simple illustration of a standard voronoi diagram clipped to a bounding polygon:
And this is a simple illustration of the geodesic voronoi diaram generated within the polygon:
I have come across four papers that describe this and some algorithms to achieve it:
I have also found a video that describes it where the points are also moving within the polygon:
Ideally any implementation would be usable from Python but any implementations at all would be appreciated to start with.
Many thanks.
发布评论