Wismath, Stephen K. and Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Meijer, Henk and Trotta, Francesco (2007) k-colored point-set embeddability of outerplanar graphs. [Conference Paper]
Full text not available from this repository.
Abstract
This 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_{k-1}$, and $k$ disjoint sets $S_0, \cdots, S_{k-1}$ of points in the plane with $|V_i|=|S_i|$ ($i \in \{0, \cdots, k-1\}$). 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.
| Item Type: | Conference Paper |
|---|---|
| Classifications: | M Methods > M.600 Planar P Styles > P.540 Planar G Algorithms and Complexity > G.210 Bends |
| ID Code: | 786 |
| Deposited By: | GDEA, Administration |
| Deposited On: | 04 May 2007 |
| Last Modified: | 18 Sep 2008 13:09 |
| Alternative Locations: | http://www.springer.com/dal/home/computer/lncs?SGWID=1-164-22-173721109-0 |
Repository Staff Only: item control page
