On Touching Triangle Graphs

Gansner, Emden R. and Hu, Yifan and Kobourov, Stephen G. (2011) On Touching Triangle Graphs. In: Graph Drawing 18th International Symposium, GD 2010, September 21-24, 2010 , pp. 250-261(Official URL: http://dx.doi.org/10.1007/978-3-642-18469-7_23).

Full text not available from this repository.

Abstract

In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representations for outerplanar graphs, square grid graphs, and hexagonal grid graphs. The class of graphs with touching triangles representations is not closed under minors, making characterization difficult. We do show that pairs of vertices can only have a small common neighborhood, and we present a complete characterization of the subclass of biconnected graphs that can be represented as triangulations of some polygon.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-18469-7_23
Classifications: Z Theory > Z.250 Geometry
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1211

Actions (login required)

View Item View Item