Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Visibility representations"'
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:
Lecture Notes in Computer Science ISBN: 9783030929305
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::54dfc9f6ca014e0970957693cb4b2fb2
http://hdl.handle.net/11391/1501322
http://hdl.handle.net/11391/1501322
Autor:
Emilio Di Giacomo, Walter Didimo, Henk Meijer, William S. Evans, Fabrizio Montecchiani, Stephen K. Wismath, Giuseppe Liotta
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319501055
Graph Drawing
Graph Drawing
An ortho-polygon visibility representation of an n-vertex embedded graph G (OPVR of G) is an embedding-preserving drawing of G that maps every vertex to a distinct orthogonal polygon and each edge to a vertical or horizontal visibility between its en
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Discrete & Computational Geometry. 60:345-380
A (weak) rectangle visibility representation, or simply an RVR, of a graph consists of an assignment of axis-aligned rectangles to vertices such that for every edge there exists a horizontal or vertical line of sight between the rectangles assigned t
A graph is k-planar if it can be drawn in the plane such that each edge is crossed at most k > 0 times. These graphs represent a natural extension of planar graphs and they are among the most investigated families in the growing field of graph drawin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::568471671f829e80241192265c139152
http://hdl.handle.net/11391/1448954
http://hdl.handle.net/11391/1448954
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Graph Drawing
Lecture Notes in Computer Science ISBN: 9783030044138
Lecture Notes in Computer Science ISBN: 9783030044138
An ortho-polygon visibility representation $\Gamma$ of a $1$-plane graph $G$ (OPVR of $G$) is an embedding preserving drawing that maps each vertex of $G$ to a distinct orthogonal polygon and each edge of $G$ to a vertical or horizontal visibility be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::307caf339846015ac559ec4b93990dcd
http://arxiv.org/abs/1807.01247
http://arxiv.org/abs/1807.01247
Autor:
Emilio Di Giacomo, Carla Binucci, Fabrizio Montecchiani, Giuseppe Liotta, William S. Evans, Sue Whitesides, Luca Grilli, Stephen K. Wismath, Henk Meijer, Alessio Arleo
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319501055
Graph Drawing
Graph Drawing
We initiate the study of 2.5D box visibility representations (2.5D-BR) where vertices are mapped to 3D boxes having the bottom face in the plane $z=0$ and edges are unobstructed lines of sight parallel to the $x$- or $y$-axis. We prove that: $(i)$ Ev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::280afda6cb0bb635b08a3706c28eaf96
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.