On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Automatic graph drawing and readability of diagrams
IEEE Transactions on Systems, Man and Cybernetics
On Conway's thrackle conjecture
Proceedings of the eleventh annual symposium on Computational geometry
Spirality and Optimal Orthogonal Drawings
SIAM Journal on Computing
Turn-regularity and optimal area drawings of orthogonal representations
Computational Geometry: Theory and Applications
On the complexity of orthogonal compaction
Computational Geometry: Theory and Applications
On the Computational Complexity of Upward and Rectilinear Planarity Testing
SIAM Journal on Computing
Computing Orthogonal Drawings with the Minimum Number of Bends
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
New Layout Techniques for Entity-Relationship Diagrams
Proceedings of the Fourth International Conference on Entity-Relationship Approach
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
| Hi-index | 0.00 |
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.