Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Alexander Ravsky"'
Autor:
Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031231001
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2674e7fac5c483d45cb733c21b112f0
https://doi.org/10.1007/978-3-031-23101-8_1
https://doi.org/10.1007/978-3-031-23101-8_1
Autor:
Steven Chaplick, Krzystof (K.) Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
Publikováno v:
Journal of Computational Geometry
Maastricht University
Journal of Computational Geometry, 11(1), 433-475. Carleton University
Maastricht University
Journal of Computational Geometry, 11(1), 433-475. Carleton University
We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes. We insist on straight-line edges and crossing-free drawings. This problem has many connections to other ch
Autor:
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
Publikováno v:
Maastricht University
It is well known that any graph admits a crossing-free straight-line drawing in $\mathbb{R}^3$ and that any planar graph admits the same even in $\mathbb{R}^2$. For a graph $G$ and $d \in \{2,3\}$, let $\rho^1_d(G)$ denote the minimum number of lines
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5627cd3407506527dc3f36ded00359b6
https://cris.maastrichtuniversity.nl/en/publications/0799c180-8d13-400e-a992-0acdc19b40c1
https://cris.maastrichtuniversity.nl/en/publications/0799c180-8d13-400e-a992-0acdc19b40c1