Straight Line Triangle Representations

Aerts, Nieke and Felsner, Stefan (2013) Straight Line Triangle Representations. In: 21st International Symposium, GD 2013, September 23-25, 2013 , 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
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 13 Aug 2014 16:12
Last Modified: 13 Aug 2014 16:12
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1366

Actions (login required)

View Item View Item