Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Felice De Luca"'
Publikováno v:
IEEE transactions on visualization and computer graphics. 28(6)
Readability criteria, such as distance or neighborhood preservation, are often used to optimize node-link representations of graphs to enable the comprehension of the underlying data. With few exceptions, graph drawing algorithms typically optimize o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::b73ea52d4abeeda66bce78e0294af65c
https://pubmed.ncbi.nlm.nih.gov/35230951
https://pubmed.ncbi.nlm.nih.gov/35230951
Publikováno v:
Electronics
Volume 9
Issue 6
Electronics, Vol 9, Iss 946, p 946 (2020)
Volume 9
Issue 6
Electronics, Vol 9, Iss 946, p 946 (2020)
Energy demand associated with the ever-increasing penetration of electric vehicles on worldwide roads is set to rise exponentially in the coming years. The fact that more and more vehicles will be connected to the electricity network will offer great
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4552dea33ff3bce6a2e8df1a4d9bb420
Mobility in smart cities is also becoming smart, promoting on the one hand transport modes based on zero emission electrical technologies and on the other providing vehicles with technological solutions that support the drivers in driving operations.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9db98f625ae2962f85c46d0c078b395c
http://hdl.handle.net/11386/4764192
http://hdl.handle.net/11386/4764192
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030687656
Graph Drawing
Graph Drawing
Readability criteria, such as distance or neighborhood preservation, are often used to optimize node-link representations of graphs to enable the comprehension of the underlying data. With few exceptions, graph drawing algorithms typically optimize o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d0fb7d194d8a231ef90c5f572dab94f
https://doi.org/10.1007/978-3-030-68766-3_1
https://doi.org/10.1007/978-3-030-68766-3_1
Autor:
Giuseppe Liotta, Alessandra Tappini, Stephen G. Kobourov, Seok-Hee Hong, Henk Meijer, William Lenhart, Emilio Di Giacomo, Felice De Luca, Stephen K. Wismath
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783030398804
WALCOM
WALCOM
We introduce and study the 1-planar packing problem: Given k graphs with n vertices \(G_1, \dots , G_k\), find a 1-planar graph that contains the given graphs as edge-disjoint spanning subgraphs. We mainly focus on the case when each \(G_i\) is a tre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee33add394018287d1410e0fb5c41a6e
http://arxiv.org/abs/1911.01761
http://arxiv.org/abs/1911.01761
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030358013
Graph Drawing
Graph Drawing
Symmetry is a key feature observed in nature (from flowers and leaves, to butterflies and birds) and in human-made objects (from paintings and sculptures, to manufactured objects and architectural design). Rotational, translational, and especially re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8da34c24b1f3ae1ec718c902b47a84c3
https://doi.org/10.1007/978-3-030-35802-0_38
https://doi.org/10.1007/978-3-030-35802-0_38
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030358013
Graph Drawing
Graph Drawing
Stress, edge crossings, and crossing angles play an important role in the quality and readability of graph drawings. Most standard graph drawing algorithms optimize one of these criteria which may lead to layouts that are deficient in other criteria.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfd9977d2a09aa45cf62fc9d55b65517
https://doi.org/10.1007/978-3-030-35802-0_23
https://doi.org/10.1007/978-3-030-35802-0_23
A \emph{Stick graph} is an intersection graph of axis-aligned segments such that the left end-points of the horizontal segments and the bottom end-points of the vertical segments lie on a `ground line,' a line with slope $-1$. It is an open question
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5fe611d3444b7ad9d07adac93aec4e1a
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030044138
Graph Drawing
Graph Drawing
Symmetry is an important factor in human perception in general, as well as in the visualization of graphs in particular. There are three main types of symmetry: reflective, translational, and rotational. We report the results of a human subjects expe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bce0c7b399080c9d661f2dbeae5494c6
https://doi.org/10.1007/978-3-030-04414-5_31
https://doi.org/10.1007/978-3-030-04414-5_31
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030044138
Graph Drawing
Graph Drawing
A Stick graph is an intersection graph of axis-aligned segments such that the left end-points of the horizontal segments and the bottom end-points of the vertical segments lie on a “ground line”, a line with slope \(-1\). It is an open question t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1fb5802fe9d6e3d2dbd146e80b4c3da
https://doi.org/10.1007/978-3-030-04414-5_21
https://doi.org/10.1007/978-3-030-04414-5_21