On Vertex- and Empty-Ply Proximity Drawings
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10368378" target="_blank" >RIV/00216208:11320/18:10368378 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007%2F978-3-319-73915-1_3" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-319-73915-1_3</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-73915-1_3" target="_blank" >10.1007/978-3-319-73915-1_3</a>
Alternative languages
Result language
angličtina
Original language name
On Vertex- and Empty-Ply Proximity Drawings
Original language description
We initiate the study of the vertex-ply of straight-line drawings, as a relaxation of the recently introduced ply number. Consider the disks centered at each vertex with radius equal to half the length of the longest edge incident to the vertex. The vertex-ply of a drawing is determined by the vertex covered by the maximum number of disks. The main motivation for considering this relaxation is to relate the concept of ply to proximity drawings. In fact, if we interpret the set of disks as proximity regions, a drawing with vertex-ply number 1 can be seen as a weak proximity drawing, which we call empty-ply drawing. We show non-trivial relationships between the ply number and the vertex-ply number. Then, we focus on empty-ply drawings, proving some properties and studying what classes of graphs admit such drawings. Finally, we prove a lower bound on the ply and the vertex-ply of planar drawings.
Czech name
—
Czech description
—
Classification
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)
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
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
Article name in the collection
Graph Drawing and Network Visualization
ISBN
978-3-319-73914-4
ISSN
0302-9743
e-ISSN
neuvedeno
Number of pages
14
Pages from-to
24-37
Publisher name
SPRINGER
Place of publication
Cham
Event location
Boston, MA, USA
Event date
Sep 25, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—