The Stub Resolution of 1-planar Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10438466" target="_blank" >RIV/00216208:11320/21:10438466 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=Y4Ox-xaTRJ" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=Y4Ox-xaTRJ</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.7155/jgaa.00575" target="_blank" >10.7155/jgaa.00575</a>
Alternative languages
Result language
angličtina
Original language name
The Stub Resolution of 1-planar Graphs
Original language description
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 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.
Czech name
—
Czech description
—
Classification
Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA18-19158S" target="_blank" >GA18-19158S: Algorithmic, structural and complexity aspects of geometric and other configurations</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Graph Algorithms and Applications
ISSN
1526-1719
e-ISSN
—
Volume of the periodical
25
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
18
Pages from-to
625-642
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-85121727214