kcolored pointset embeddability of outerplanar graphsWismath, Stephen K. and Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Meijer, Henk and Trotta, Francesco (2007) kcolored pointset embeddability of outerplanar graphs. In: Graph Drawing 14th International Symposium, GD 2006, September 1820, 2006 , pp. 318329(Official URL: http://dx.doi.org/10.1007/9783540709046_31). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/9783540709046_31
AbstractThis paper addresses the problem of designing drawing algorithms that receive as input a planar graph G, a partitioning of the vertices of G into k different semantic categories V_0,\cdots, V_{k1}, and k disjoint sets S_0, \cdots, S_{k1} of points in the plane with V_i=S_i (i \in \{0, \cdots, k1\}).The desired output is a planar drawing such that the vertices of V_i are mapped onto the points of S_i and such that the curve complexity of the edges (i.e. the number of bends along each edge) is kept small. Particular attention is devoted to outerplanar graphs, for which lower and upper bounds on the number of bends in the drawings are established.
Actions (login required)
