Geodesic
Point-Set Embedding in Three Dimensions
Journal of Graph Algorithms and Applications, Tome 19 (2015) no. 1, pp. 243-257.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

Given a graph $G$ with $n$ vertices and $m$ edges, and a set $P$ of $n$ points on a three-dimensional integer grid, the 3D Point-Set Embeddability problem is to determine a (three-dimensional) crossing-free drawing of $G$ with vertices located at $P$ and with edges drawn as poly-lines with bend-points at integer grid points. We solve a variant of the problem in which the points of $P$ lie on a plane. The resulting drawing lies in a bounding box of reasonable volume and uses at most $O(\log m)$ bends per edge. If a particular point-set $P$ is not specified, we show that the graph $G$ can be drawn crossing-free with at most $O(\log m)$ bends per edge in a volume bounded by $O((n+m) \log m)$. Our construction is asymptotically similar to previously known drawings, however avoids a possibly non-polynomial preprocessing step.
DOI : 10.7155/jgaa.00355
Keywords: graph drawing, point set embedding, 3D drawing, bends, crossing-free 
@article{JGAA_2015_19_1_a9,
     author = {Henk Meijer and Stephen Wismath},
     title = {Point-Set {Embedding} in {Three} {Dimensions}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {243--257},
     publisher = {mathdoc},
     volume = {19},
     number = {1},
     year = {2015},
     doi = {10.7155/jgaa.00355},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00355/}
}
TY  - JOUR
AU  - Henk Meijer
AU  - Stephen Wismath
TI  - Point-Set Embedding in Three Dimensions
JO  - Journal of Graph Algorithms and Applications
PY  - 2015
SP  - 243
EP  - 257
VL  - 19
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00355/
DO  - 10.7155/jgaa.00355
LA  - en
ID  - JGAA_2015_19_1_a9
ER  - 
%0 Journal Article
%A Henk Meijer
%A Stephen Wismath
%T Point-Set Embedding in Three Dimensions
%J Journal of Graph Algorithms and Applications
%D 2015
%P 243-257
%V 19
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00355/
%R 10.7155/jgaa.00355
%G en
%F JGAA_2015_19_1_a9
Henk Meijer; Stephen Wismath. Point-Set Embedding in Three Dimensions. Journal of Graph Algorithms and Applications, Tome 19 (2015) no. 1, pp. 243-257. doi : 10.7155/jgaa.00355. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00355/

Cité par Sources :