Geodesic
The Stub Resolution of 1-planar Graphs
Journal of Graph Algorithms and Applications, Special Issue on Selected Papers from the 14th International Conference and Workshops on Algorithms and Computation, WALCOM 2020 , Tome 25 (2021) no. 2, pp. 625-642.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

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. Intersection points divide edges 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 $\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 IC-planar graph, i.e., 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. 
@article{JGAA_2021_25_2_a2,
     author = {Michael Kaufmann and Jan Kratochvil and Fabian Lipp and Fabrizio Montecchiani and Chrysanthi Raftopoulou and Pavel Valtr},
     title = {The {Stub} {Resolution} of 1-planar {Graphs}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {625--642},
     publisher = {mathdoc},
     volume = {25},
     number = {2},
     year = {2021},
     doi = {10.7155/jgaa.00575},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00575/}
}
TY  - JOUR
AU  - Michael Kaufmann
AU  - Jan Kratochvil
AU  - Fabian Lipp
AU  - Fabrizio Montecchiani
AU  - Chrysanthi Raftopoulou
AU  - Pavel Valtr
TI  - The Stub Resolution of 1-planar Graphs
JO  - Journal of Graph Algorithms and Applications
PY  - 2021
SP  - 625
EP  - 642
VL  - 25
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00575/
DO  - 10.7155/jgaa.00575
LA  - en
ID  - JGAA_2021_25_2_a2
ER  - 
%0 Journal Article
%A Michael Kaufmann
%A Jan Kratochvil
%A Fabian Lipp
%A Fabrizio Montecchiani
%A Chrysanthi Raftopoulou
%A Pavel Valtr
%T The Stub Resolution of 1-planar Graphs
%J Journal of Graph Algorithms and Applications
%D 2021
%P 625-642
%V 25
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00575/
%R 10.7155/jgaa.00575
%G en
%F JGAA_2021_25_2_a2
Michael Kaufmann; Jan Kratochvil; Fabian Lipp; Fabrizio Montecchiani; Chrysanthi Raftopoulou; Pavel Valtr. The Stub Resolution of 1-planar Graphs. Journal of Graph Algorithms and Applications, 
							Special Issue on Selected Papers from the 14th International Conference and  Workshops on Algorithms and Computation, WALCOM 2020
					, Tome 25 (2021) no. 2, pp. 625-642. doi : 10.7155/jgaa.00575. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00575/

Cité par Sources :