Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Carla Binucci"'
Autor:
Carla Binucci, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
Publikováno v:
IEEE Access, Vol 12, Pp 68828-68846 (2024)
Graph drawing beyond planarity is a research area that has received an increasing attention in the last twenty years, driven by the necessity to mitigate the visual complexity inherent in geometric representations of non-planar graphs. This research
Externí odkaz:
https://doaj.org/article/678bca8bfdb449b7bf54ecc84a394fb6
Publikováno v:
International Journal of Foundations of Computer Science. :1-28
This paper studies a packing problem in the so-called beyond-planar setting, that is when the host graph is “almost-planar” in some sense. Precisely, we consider the case that the host graph is [Formula: see text]-planar, i.e., it admits an embed
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031222023
The problem of orienting the edges of an undirected graph such that the resulting digraph is acyclic and has a single source s and a single sink t has a long tradition in graph theory and is central to many graph drawing algorithms. Such an orientati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2420e9e9414f6c0a0d44d1e54cffef76
https://hdl.handle.net/11391/1549097
https://hdl.handle.net/11391/1549097
Autor:
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031222023
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4eb9fcfcda344667dc5fb68361a4f734
https://doi.org/10.1007/978-3-031-22203-0_22
https://doi.org/10.1007/978-3-031-22203-0_22
Autor:
Ignaz Rutter, Karsten Klein, Carla Binucci, Maurizio Patrignani, Giuseppe Di Battista, Michael A. Bekos, Martin Gronemann, Walter Didimo
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030687656
Graph Drawing
Graph Drawing
An interesting class of orthogonal representations consists of the so-called turn-regular ones, i.e., those that do not contain any pair of reflex corners that "point to each other" inside a face. For such a representation H it is possible to compute
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::260355b0b96171754d58fa10b7489c2d
http://jgaa.info/getPaper?id=595
http://jgaa.info/getPaper?id=595
Publikováno v:
Computational Geometry. 108:101900
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030929305
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f69236aa480147ebb3a18f407e5d495d
http://hdl.handle.net/11391/1532756
http://hdl.handle.net/11391/1532756
Autor:
Carla Binucci, Henk Meijer, Vera Sacristán, Emilio Di Giacomo, Stephen K. Wismath, Seok-Hee Hong, Giuseppe Liotta
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
© 2020. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ In a visibility representation of a graph G, the vertices are represented by nonoverlapping geometric objects, whil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81b1b060abeb430a6338344cd0e7f04a
https://hdl.handle.net/2117/177518
https://hdl.handle.net/2117/177518
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783030398804
WALCOM
WALCOM
The definition of $1$-planar graphs naturally extends graph planarity, namely a graph is $1$-planar if it can be drawn in the plane with at most one crossing per edge. Unfortunately, while testing graph planarity is solvable in linear time, deciding
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3cd0c766156ff86eb9c01785f028597
http://arxiv.org/abs/1911.00573
http://arxiv.org/abs/1911.00573