论文标题
在二维设置颗粒系统的Voronoi镶嵌物
Set Voronoi Tessellation for Particulate Systems in Two Dimensions
论文作者
论文摘要
鉴于在连续空间中的一组可数点，Voronoi Tessellation是根据与单个点的距离对空间进行分区的直观方式。作为获取结构信息的强大方法，它在从天文学到城市规划的各种学科中拥有悠久的历史和广泛的应用。对于现实生活中的颗粒系统，例如一堆沙子或一群行人，需要修改Voronoi Tessellation的实现，以适应一个不能简单地将颗粒视为点的事实。在这里，我们阐明了集合voronoi tessellation的使用（即，在其表面上考虑非球形粒子一组点）在颗粒杆的准二维系统中提取有意义的局部信息。此外，我们说明了如何将其应用于任意形状的颗粒，例如蜜蜂的组装或行人，以获取结构信息。讨论了有关该算法实施及其平衡计算成本和准确性策略的详细信息。此外，我们将Python代码作为开源代码，以便在任意形状的对象的两个维度中设置Voronoi计算。
Given a countable set of points in a continuous space, Voronoi tessellation is an intuitive way of partitioning the space according to the distance to the individual points. As a powerful approach to obtain structural information, it has a long history and widespread applications in diverse disciplines, from astronomy to urban planning. For particulate systems in real life, such as a pile of sand or a crowd of pedestrians, the realization of Voronoi tessellation needs to be modified to accommodate the fact that the particles cannot be simply treated as points. Here, we elucidate the use of Set Voronoi tessellation (i.e., considering for a non-spherical particle a set of points on its surface) to extract meaningful local information in a quasi-two-dimensional system of granular rods. In addition, we illustrate how it can be applied to arbitrarily shaped particles such as an assembly of honey bees or pedestrians for obtaining structural information. Details on the implementation of this algorithm with the strategy of balancing computational cost and accuracy are discussed. Furthermore, we provide our python code as open source in order to facilitate Set Voronoi calculations in two dimensions for arbitrarily shaped objects.
