%0 Conference Paper %1 10.1007/978-3-030-39881-1_15 %A Kaufmann, Michael %A Kratochvil, Jan %A Lipp, Fabian %A Montecchiani, Fabrizio %A Raftopoulou, Chrysanthi %A Valtr, Pavel %B WALCOM: Algorithms and Computation %D 2020 %E Rahman, M. Sohel %E Sadakane, Kunihiko %E Sung, Wing-Kin %I Springer %K 1-planar graph-drawing myown resolution stub %P 170--182 %R 10.1007/978-3-030-39881-1_15 %T The Stub Resolution of 1-Planar Graphs %U https://link.springer.com/chapter/10.1007%2F978-3-030-39881-1_15 %V 12049 %X The resolution of a drawing plays a crucial role when defining criteria for its quality. In the past, grid resolution, edge-length resolution, angular resolution and crossing resolution have been investigated. In this paper, we investigate the stub resolution, a recently introduced criterion for nonplanar drawings. A crossed edge is divided into parts, called stubs, which should not be too short for the sake of readability. Thus, the stub resolution of a drawing is defined as the minimum ratio between the length of a stub and the length of the entire edge, over all the edges of the drawing. We consider 1-planar graphs and we explore scenarios in which near optimal stub resolution, i.e. arbitrarily close to \$\$\backslashfrac\1\\2\\$\$, can be obtained in drawings with zero, one, or two bends per edge, as well as further resolution criteria, such as angular and crossing resolution. In particular, our main contributions are as follows: (i) Every 1-planar graph with independent crossing edges has a straight-line drawing with near optimal stub resolution; (ii) Every 1-planar graph has a 1-bend drawing with near optimal stub resolution. %@ 978-3-030-39881-1

@inproceedings{10.1007/978-3-030-39881-1_15, abstract = {The resolution of a drawing plays a crucial role when defining criteria for its quality. In the past, grid resolution, edge-length resolution, angular resolution and crossing resolution have been investigated. In this paper, we investigate the stub resolution, a recently introduced criterion for nonplanar drawings. A crossed edge is divided into parts, called stubs, which should not be too short for the sake of readability. Thus, the stub resolution of a drawing is defined as the minimum ratio between the length of a stub and the length of the entire edge, over all the edges of the drawing. We consider 1-planar graphs and we explore scenarios in which near optimal stub resolution, i.e. arbitrarily close to {\$}{\$}{\backslash}frac{\{}1{\}}{\{}2{\}}{\$}{\$}, can be obtained in drawings with zero, one, or two bends per edge, as well as further resolution criteria, such as angular and crossing resolution. In particular, our main contributions are as follows: (i) Every 1-planar graph with independent crossing edges has a straight-line drawing with near optimal stub resolution; (ii) Every 1-planar graph has a 1-bend drawing with near optimal stub resolution.}, added-at = {2020-02-04T00:35:48.000+0100}, author = {Kaufmann, Michael and Kratochvil, Jan and Lipp, Fabian and Montecchiani, Fabrizio and Raftopoulou, Chrysanthi and Valtr, Pavel}, biburl = {https://www.bibsonomy.org/bibtex/2eec031f40e96c1a20b0bc40b8b449be0/fabianlipp}, booktitle = {WALCOM: Algorithms and Computation}, doi = {10.1007/978-3-030-39881-1_15}, editor = {Rahman, M. Sohel and Sadakane, Kunihiko and Sung, Wing-Kin}, interhash = {9e248497e1e2e539348dc78da163de78}, intrahash = {eec031f40e96c1a20b0bc40b8b449be0}, isbn = {978-3-030-39881-1}, keywords = {1-planar graph-drawing myown resolution stub}, pages = {170--182}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2020-02-04T00:35:48.000+0100}, title = {The Stub Resolution of 1-Planar Graphs}, url = {https://link.springer.com/chapter/10.1007%2F978-3-030-39881-1_15}, volume = 12049, year = 2020 }