Geodesic
Drawing 3-Polytopes with Good Vertex Resolution
Journal of Graph Algorithms and Applications, Special Issue on Selected Papers from the Seventeenth International Symposium on Graph Drawing, GD 2009 , Tome 15 (2011) no. 1, pp. 33-52.

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

We study the problem how to obtain a small drawing of a 3-polytope with Euclidean distance between any two points at least 1. The problem can be reduced to a one-dimensional problem, since it is sufficient to guarantee distinct integer x-coordinates. We develop an algorithm that yields an embedding with the desired property such that the polytope is contained inside a 2(n−2)×2 ×1 box. The constructed embedding can be scaled to a grid embedding whose x-coordinates are contained in [0,2(n−2)]. Furthermore, the point set of the embedding has a small spread, which differs from the best possible spread only by a multiplicative constant.
DOI : 10.7155/jgaa.00216
Keywords: graph drawing, 3D polytope, vertex resolution, barycentric embedding 
@article{JGAA_2011_15_1_a2,
     author = {Andr\'e Schulz},
     title = {Drawing {3-Polytopes} with {Good} {Vertex} {Resolution}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {33--52},
     publisher = {mathdoc},
     volume = {15},
     number = {1},
     year = {2011},
     doi = {10.7155/jgaa.00216},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00216/}
}
TY  - JOUR
AU  - André Schulz
TI  - Drawing 3-Polytopes with Good Vertex Resolution
JO  - Journal of Graph Algorithms and Applications
PY  - 2011
SP  - 33
EP  - 52
VL  - 15
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00216/
DO  - 10.7155/jgaa.00216
LA  - en
ID  - JGAA_2011_15_1_a2
ER  - 
%0 Journal Article
%A André Schulz
%T Drawing 3-Polytopes with Good Vertex Resolution
%J Journal of Graph Algorithms and Applications
%D 2011
%P 33-52
%V 15
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00216/
%R 10.7155/jgaa.00216
%G en
%F JGAA_2011_15_1_a2
André Schulz. Drawing 3-Polytopes with Good Vertex Resolution. Journal of Graph Algorithms and Applications, 
							Special Issue on Selected Papers from the Seventeenth International Symposium on Graph Drawing, GD 2009
					, Tome 15 (2011) no. 1, pp. 33-52. doi : 10.7155/jgaa.00216. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00216/

Cité par Sources :