Trade-Offs in Planar Polyline Drawings - Graph Drawing - page 316

A natural open question is whether Duncan and Kobourov's algorithm could
be modified (allowing 2-bends per edge) to achieve a better trade-off. Finding
tight lower bounds would also be very interesting. Finally, we hope that the re-
sults in this paper will encourage the study of smooth trade-offs among different
aesthetic criteria for other styles of drawing graphs.
References
1. Biedl, T.C., Kaufmann, M.: Area-ecient static and incremental graph drawings.
In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS, vol. 1284, pp. 37-52.
Springer, Heidelberg (1997)
2. Bonichon, N., Felsner, S., Mosbah, M.: Convex drawings of 3-connected plane
graphs. Algorithmica 47(4), 399-420 (2007)
3. Bonichon, N., Le Saec, B., Mosbah, M.: Wagner's theorem on realizers. In: Wid-
mayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.)
ICALP 2002. LNCS, vol. 2380, pp. 1043-1053. Springer, Heidelberg (2002)
4. Brandenburg, F.J.: Drawing planar graphs on 9 n 2 area. Electronic Notes in Dis-
crete Mathematics 31, 37-40 (2008)
5. Cheng, C.C., Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Drawing planar
graphs with circular arcs. Discrete & Computational Geometry 25(3), 405-418
(2001)
6. Chrobak, M., Payne, T.: A linear-time algorithm for drawing planar graphs. Infor-
mation Processing Letters 54, 241-246 (1995)
7. CircuitLogix, https://www.circuitlogix.com/ (accessed June 03, 2014)
8. ConceptDraw: http://www.conceptdraw.com/ (accessed June 03, 2014)
9. De Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid.
Combinatorica 10(1), 41-51 (1990)
10. Duncan, C.A., Kobourov, S.G.: Polar coordinate drawing of planar graphs with
good angular resolution. Journal of Graph Algorithms and Applications 7(4), 311-
333 (2003)
11. Durocher, S., Mondal, D.: On balanced +-contact representations. In: Proceedings
of GD. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 143-154.
Springer, Heidelberg (2013)
12. Goodrich, M.T., Wagner, C.G.: A framework for drawing planar graphs with curves
and polylines. Journal of Algorithms 37(2), 399-421 (2000)
13. Gutwenger, C., Mutzel, P.: Planar polyline drawings with good angular resolu-
tion. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 167-182. Springer,
Heidelberg (1999)
14. Hong, S.H., Mader, M.: Generalizing the shift method for rectangular shaped ver-
tices with visibility constraints. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008.
LNCS, vol. 5417, pp. 278-283. Springer, Heidelberg (2009)
15. Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16(1),
4-32 (1996)
16. Kurowski, M.: Planar straight-line drawing in an o ( n ) × o ( n ) grid with angular
resolution ˉ (1 /n ). In: Vojtas, P., Bielikova, M., Charron-Bost, B., Sykora, O. (eds.)
SOFSEM 2005. LNCS, vol. 3381, pp. 250-258. Springer, Heidelberg (2005)
17. Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of ACM-
SIAM SODA, January 22-24, pp. 138-148. ACM (1990)