VoronoiDiagram
VoronoiDiagram[{{x1,y1},{x2,y2},…}]
yields the planar Voronoi diagram of the points {x1,y1},{x2,y2},….
VoronoiDiagram[{{x1,y1},{x2,y2},…},val]
takes val to be the Delaunay triangulation vertex adjacency list.
VoronoiDiagram[{{x1,y1},{x2,y2},…},val,hull]
takes hull to be the convex hull index list.
更多信息和选项
- VoronoiDiagram functionality is now available in the built-in Wolfram Language function VoronoiMesh.
- To use VoronoiDiagram, you first need to load the Computational Geometry Package using Needs["ComputationalGeometry`"].
- The Voronoi diagram is represented by two lists, a vertex coordinate list and a vertex adjacency list.
- An element {i,{v1,…}} of the vertex adjacency list corresponds to the point {xi,yi}, and the indices v1,… identify the vertices or rays in the vertex coordinate list that form the polygon associated with the point {xi,yi}.
- The optional arguments val and hull may be used to speed up the Voronoi diagram computation if the Delaunay triangulation and convex hull are available.
文本
Wolfram Research (2012)，VoronoiDiagram，Wolfram 语言函数，https://reference.wolfram.com/language/ComputationalGeometry/ref/VoronoiDiagram.html.
CMS
Wolfram 语言. 2012. "VoronoiDiagram." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/ComputationalGeometry/ref/VoronoiDiagram.html.
APA
Wolfram 语言. (2012). VoronoiDiagram. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/ComputationalGeometry/ref/VoronoiDiagram.html 年