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,...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
MDPI AG
2024-08-01
|
| Schriftenreihe: | Mathematics |
| Schlagworte: | |
| Online-Zugang: | https://www.mdpi.com/2227-7390/12/15/2426 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|