Converting Tessellations into Graphs: From Voronoi Tessellations to Complete Graphs
A mathematical procedure enabling the transformation of an arbitrary tessellation of a surface into a bi-colored, complete graph is introduced. Polygons constituting the tessellation are represented by vertices of the graphs. Vertices of the graphs are connected by two kinds of links/edges, namely,...
Збережено в:
| Автори: | , , , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
MDPI AG
2024-08-01
|
| Серія: | Mathematics |
| Предмети: | |
| Онлайн доступ: | https://www.mdpi.com/2227-7390/12/15/2426 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|