The Stub Resolution of 1-Planar Graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10420251" target="_blank" >RIV/00216208:11320/20:10420251 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1007/978-3-030-39881-1_15" target="_blank" >https://doi.org/10.1007/978-3-030-39881-1_15</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-39881-1_15" target="_blank" >10.1007/978-3-030-39881-1_15</a>

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. 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 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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

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)

Publication year

2020

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

WALCOM: Algorithms and Computation - 14th International Conference, WALCOM 2020

ISBN

978-3-030-39880-4

ISSN

0302-9743

e-ISSN

—

Number of pages

13

Pages from-to

170-182

Publisher name

Springer Nature Switzerland

Place of publication

Cham

Event location

Singapur

Event date

Mar 31, 2020

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—