Geodesic
Planar Drawings of Higher-Genus Graphs
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. 7-32.

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

In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R2, with a bounding face defined by a polygonal schema P for S. Our drawings are planar, but they allow for multiple copies of vertices and edges on P's boundary, which is a common way of visualizing higher-genus graphs in the plane. However, unlike traditional approaches the copies of the vertices might not be in perfect alignment but we guarantee that their order along the boundary is still preserved. Our drawings can be defined with respect to either a canonical polygonal schema or a polygonal cutset schema, which provides an interesting tradeoff, since canonical schemas have fewer sides, and have a nice topological structure, but they can have many more repeated vertices and edges than general polygonal cutsets. As a side note, we show that it is NP-complete to determine whether a given graph embedded in a genus-g surface has a set of 2g fundamental cycles with vertex-disjoint interiors, which would be desirable from a graph-drawing perspective.
DOI : 10.7155/jgaa.00215
Keywords: graph drawing, higher-genus graphs, planar drawings 
@article{JGAA_2011_15_1_a1,
     author = {Christian Duncan and Michael Goodrich and Stephen Kobourov},
     title = {Planar {Drawings} of {Higher-Genus} {Graphs}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {7--32},
     publisher = {mathdoc},
     volume = {15},
     number = {1},
     year = {2011},
     doi = {10.7155/jgaa.00215},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00215/}
}
TY  - JOUR
AU  - Christian Duncan
AU  - Michael Goodrich
AU  - Stephen Kobourov
TI  - Planar Drawings of Higher-Genus Graphs
JO  - Journal of Graph Algorithms and Applications
PY  - 2011
SP  - 7
EP  - 32
VL  - 15
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00215/
DO  - 10.7155/jgaa.00215
LA  - en
ID  - JGAA_2011_15_1_a1
ER  - 
%0 Journal Article
%A Christian Duncan
%A Michael Goodrich
%A Stephen Kobourov
%T Planar Drawings of Higher-Genus Graphs
%J Journal of Graph Algorithms and Applications
%D 2011
%P 7-32
%V 15
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00215/
%R 10.7155/jgaa.00215
%G en
%F JGAA_2011_15_1_a1
Christian Duncan; Michael Goodrich; Stephen Kobourov. Planar Drawings of Higher-Genus Graphs. 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. 7-32. doi : 10.7155/jgaa.00215. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00215/

Cité par Sources :