2026-07-23T06:18:10Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:19304 2024-03-06T11:03:43Z ddc:004 open_access

Faithful Graph Drawing (Invited Talk) Hong, Seok-Hee Graph drawing Planar graphs Beyond planar graphs Tutte’s barycenter theorem Steinitz’s theorem Fáry’s theorem Sublinear-time graph drawing algorithm Faithful graph drawing Symmetric graph drawing Graph drawing aims to compute good geometric representations of graphs in two or three dimensions. It has wide applications in network visualisation, such as social networks and biological networks, arising from many other disciplines. This talk will review fundamental theoretical results as well as recent advances in graph drawing, including symmetric graph drawing, generalisation of the Tutte’s barycenter theorem, Steinitz’s theorem, and Fáry’s theorem, and the so-called beyond planar graphs such as k-planar graphs. I will conclude my talk with recent progress in visualization of big complex graphs, including sublinear-time graph drawing algorithms and faithful graph drawing. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Seok-Hee Hong 2023 Is Part Of LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ISAAC.2023.2 urn:nbn:de:0030-drops-193044 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.2 eng https://creativecommons.org/licenses/by/4.0/legalcode