Straight Line Triangle Representations

Aerts, Nieke and Felsner, Stefan (2013) Straight Line Triangle Representations. In: 21st International Symposium, GD 2013, September 23-25, 2013, Bordeaux, France , pp. 119-130 (Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_11).

Full text not available from this repository.

Abstract

A straight line triangle representation (SLTR) of a planar graph is a straight line drawing such that all the faces including the outer face have triangular shape. Such a drawing can be viewed as a tiling of a triangle using triangles with the input graph as skeletal structure. In this paper we present a characterization of graphs that have an SLTR that is based on flat angle assignments, i.e., selections of angles of the graph that have size π in the representation. We also provide a second characterization in terms of contact systems of pseudosegments. With the aid of discrete harmonic functions we show that contact systems of pseudosegments that respect certain conditions are stretchable. The stretching procedure is then used to get straight line triangle representations. Since the discrete harmonic function approach is quite flexible it allows further applications, we mention some of them. The drawback of the characterization of SLTRs is that we are not able to effectively check whether a given graph admits a flat angle assignment that fulfills the conditions. Hence it is still open to decide whether the recognition of graphs that admit straight line triangle representation is polynomially tractable.

Item Type:Conference Paper
Classifications:P Styles > P.720 Straight-line
Z Theory > Z.500 Representations
ID Code:1366

Repository Staff Only: item control page

References

Aerts, N., Felsner, S.: Henneberg steps for Triangle Representations, http://page.math.tu-berlin.de/~aerts/pubs/ptsltr.pdf

Alam, M.J., Fowler, J., Kobourov, S.G.: Outerplanar graphs with proper touching triangle representations (unpublished manuscript)

de Fraysseix, H., de Mendez, P.O.: Stretching of jordan arc contact systems. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 71–85. Springer, Heidelberg (2004)

de Fraysseix, H., Ossona de Mendez, P.: Contact and intersection representations. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 217–227. Springer, Heidelberg (2005)

de Fraysseix, H., de Mendez, P.O.: Barycentric systems and stretchability. Discrete Applied Mathematics 155, 1079–1095 (2007)

de Verdière, Y.C.: Comment rendre géodésique une triangulation d’une surface? L’Enseignement Mathématique 37, 201–212 (1991)

Gansner, E.R., Hu, Y., Kobourov, S.G.: On Touching Triangle Graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 250–261. Springer, Heidelberg (2011)

Haas, R., Orden, D., Rote, G., Santos, F., Servatius, B., Servatius, H., Souvaine, D.L., Streinu, I., Whiteley, W.: Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. 31, 31–61 (2005)

Kenyon, R., Sheffield, S.: Dimers, tilings and trees. J. Comb. Theory, Ser. B 92, 295–317 (2004)

Kobourov, S.G., Mondal, D., Nishat, R.I.: Touching triangle representations for 3-connected planar graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 199–210. Springer, Heidelberg (2013)

Lovász, L.: Geometric representations of graphs, Draft version (December 11, 2009), http://www.cs.elte.hu/~lovasz/geomrep.pdf

Tutte, W.T.: How to draw a graph. Proc. of the London Math. Society 13, 743–767 (1963)