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. -
GIUSEPPE DI BATTISTA, FABRIZIO FRATI, & MAURIZIO PATRIGNANI (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.
Titolo: | On Embedding a Graph on the Grid with the Maximum Number of Bends and Other Bad Features |
Autori: | |
Data di pubblicazione: | 2009 |
Rivista: | |
Citazione: | GIUSEPPE DI BATTISTA, FABRIZIO FRATI, & MAURIZIO PATRIGNANI (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. |
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. - |
Handle: | http://hdl.handle.net/11590/124440 |
Appare nelle tipologie: | 1.1 Articolo in rivista |