Geodesic
Straight-Line Triangle Representations via Schnyder Labelings
Journal of Graph Algorithms and Applications, Tome 19 (2015) no. 1, pp. 467-505.

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

A straight-line triangle representation (SLTR) of a planar graph is a straight-line drawing such that all the faces including the outer face are triangles. Such a drawing can be viewed as a tiling of a triangle with triangles where the input graph is the skeletal structure. A characterization based on flat angle assignments, i.e., selections of angles of the graph that are of size π in the representation, has been presented in earlier work. The drawback of this characterization of SLTRs is that we have no efficient algorithm for testing whether a given graph admits a flat angle assignment that fulfills the conditions. In this paper we present a new characterization based on Schnyder woods. For graphs with few Schnyder woods there exists a polynomial algorithm to check whether the conditions of this characterization are satisfied. However, there are planar 3-connected graphs on n vertices, which have 3.209n Schnyder woods. We also present a translation of the new characterization into a 2-commodity flow problem. Deciding whether a 2-commodity flow problem has an integral solution is known to be NP-complete. Hence, it is still open to decide whether the recognition of graphs that admit a straight line triangle representation is polynomially tractable.
DOI : 10.7155/jgaa.00372
Keywords: Straight-Line Triangle Representations, Schnyder Labeling, Planar Graphs, 2-Commodity Network, Flow Network, SLTR 
@article{JGAA_2015_19_1_a22,
     author = {Nieke Aerts and Stefan Felsner},
     title = {Straight-Line {Triangle} {Representations} via {Schnyder} {Labelings}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {467--505},
     publisher = {mathdoc},
     volume = {19},
     number = {1},
     year = {2015},
     doi = {10.7155/jgaa.00372},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00372/}
}
TY  - JOUR
AU  - Nieke Aerts
AU  - Stefan Felsner
TI  - Straight-Line Triangle Representations via Schnyder Labelings
JO  - Journal of Graph Algorithms and Applications
PY  - 2015
SP  - 467
EP  - 505
VL  - 19
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00372/
DO  - 10.7155/jgaa.00372
LA  - en
ID  - JGAA_2015_19_1_a22
ER  - 
%0 Journal Article
%A Nieke Aerts
%A Stefan Felsner
%T Straight-Line Triangle Representations via Schnyder Labelings
%J Journal of Graph Algorithms and Applications
%D 2015
%P 467-505
%V 19
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00372/
%R 10.7155/jgaa.00372
%G en
%F JGAA_2015_19_1_a22
Nieke Aerts; Stefan Felsner. Straight-Line Triangle Representations via Schnyder Labelings. Journal of Graph Algorithms and Applications, Tome 19 (2015) no. 1, pp. 467-505. doi : 10.7155/jgaa.00372. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00372/

Cité par Sources :