IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i15p2426-d1449963.html
   My bibliography  Save this article

Converting Tessellations into Graphs: From Voronoi Tessellations to Complete Graphs

Author

Listed:
  • Artem Gilevich

    (Department of Chemical Engineering, Ariel University, P.O. Box 3, Ariel 407000, Israel)

  • Shraga Shoval

    (Department of Industrial Engineering and Management, Faculty of Engineering, Ariel University, P.O. Box 3, Ariel 407000, Israel)

  • Michael Nosonovsky

    (Department of Mechanical Engineering, University of Wisconsin-Milwaukee, Milwaukee, WI 53211, USA)

  • Mark Frenkel

    (Department of Chemical Engineering, Ariel University, P.O. Box 3, Ariel 407000, Israel)

  • Edward Bormashenko

    (Department of Chemical Engineering, Ariel University, P.O. Box 3, Ariel 407000, Israel)

Abstract

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, by a green link, when polygons have the same number of sides, and by a red link, when the polygons have a different number of sides. This procedure gives rise to a semi-transitive, complete, bi-colored Ramsey graph. The Ramsey semi-transitive number was established as R t r a n s ( 3 , 3 ) = 5 Shannon entropies of the tessellation and graphs are introduced. Ramsey graphs emerging from random Voronoi and Poisson Line tessellations were investigated. The limits ζ = lim N → ∞ N g N r , where N is the total number of green and red seeds, N g and N r , were found ζ = 0.272 ± 0.001 (Voronoi) and ζ = 0.47 ± 0.02 (Poisson Line). The Shannon Entropy for the random Voronoi tessellation was calculated as S = 1.690 ± 0.001 and for the Poisson line tessellation as S = 1.265 ± 0.015. The main contribution of the paper is the calculation of the Shannon entropy of the random point process and the establishment of the new bi-colored Ramsey graph on top of the tessellations.

Suggested Citation

  • Artem Gilevich & Shraga Shoval & Michael Nosonovsky & Mark Frenkel & Edward Bormashenko, 2024. "Converting Tessellations into Graphs: From Voronoi Tessellations to Complete Graphs," Mathematics, MDPI, vol. 12(15), pages 1-12, August.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:15:p:2426-:d:1449963
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/15/2426/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/15/2426/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:15:p:2426-:d:1449963. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.