arrow
返回

An iterative seed finding algorithm quantifies Voronoiness

delete2026-09-25
delete0
delete
OA
AI
N
Nejdet Balkır Göka
K
Koray Yavuz
E
Emin Aliyev
A
Arash Mobaraki
A
Ali Javili
S
Seymur Jahangirov *
DOI:10.1038/s41598-026-69660-7delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Cellular structures produced by natural processes are typically regarded as Voronoi tessellations, albeit without rigorous mathematical justification. Generating Voronoi tessellations from given seed points is well established, and there are complex algorithms that find the seed points given a Voronoi tessellation. Here, we introduce a simple iterative algorithm that finds seeds of Voronoi tessellations with arbitrary precision. The algorithm is robust against degenerate vertices and converges to a unique solution for non-Voronoi tessellations as well. Using this property of the algorithm, we introduce the notion of “Voronoiness”. We can quantify Voronoiness for each cell as a unitless number. The value starts at 1 (representing a perfect Voronoi cell) and decreases monotonically as the tessellation deviates from the ideal structure. We show that Voronoiness deviation arising from small linear transformations of the ideal honeycomb structure mimics the deviatoric stress of its mechanical counterpart. We propose that spatial quantification of Voronoiness could be beneficial for understanding cellular structures without assuming they are ideal Voronoi tessellations. As a case study, we generate spatial maps of Voronoiness of various insect wing venations. The resulting maps show that secondary venation patterns can have significant deviation from the ideal Voronoi tessellation.
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Scientific Reports 封面图
Scientific Reports
IF:
3.9
论文数:
28.7W
被引数:
108.9W

机构

U
Universidad Carlos III de Madrid
学者数:
207
论文数: 103
被引数: 2.5K
B
Bilkent University
学者数:
140
论文数: 76
被引数: 56
A
Aydin Adnan Menderes University
学者数:
74
论文数: 44
被引数: 15
学者 查看更多机构
引用论文

引用论文

暂无论文信息