Graph Drawing is (usually) concerned with the production of readable representations of graphs. In this paper, instead of investigating how to produce "good" drawings we tackle the opposite problem of producing "bad" drawings. In particular, we study how to construct orthogonal drawings with many bends along the edges and with large area. Our results show surprising contact points, in Graph Drawing, between the computational cost of niceness and the one of ugliness. -
DI BATTISTA, G., Frati, F., Patrignani, M. (2009). On Embedding a Graph on the Grid with the Maximum Number of Bends and Other Bad Features. THEORY OF COMPUTING SYSTEMS, 44(2), 143-149 [10.1007/s00224-008-9115-0].
On Embedding a Graph on the Grid with the Maximum Number of Bends and Other Bad Features
DI BATTISTA, Giuseppe;FRATI, FABRIZIO;PATRIGNANI, Maurizio
2009-01-01
Abstract
Graph Drawing is (usually) concerned with the production of readable representations of graphs. In this paper, instead of investigating how to produce "good" drawings we tackle the opposite problem of producing "bad" drawings. In particular, we study how to construct orthogonal drawings with many bends along the edges and with large area. Our results show surprising contact points, in Graph Drawing, between the computational cost of niceness and the one of ugliness. -I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
