1. Arkin EM, Connelly R, Mitchell JS (1989) On monotone paths among obstacles with applications to planning assemblies. In: Proceedings of the fifth annual symposium on computational geometry (SCG ’89), Saarbrücken. ACM, New York, pp 334–343
2. Chiba N, Yamanouchi T, Nishizeki T (1984) Linear algorithms for convex drawings of planar graphs. In: Bondy JA, Murty USR (eds) Progress in graph theory. Academic, Toronto, pp 153–173
3. Chiba N, Onoguchi K, Nishizeki T (1985) Drawing planar graphs nicely. Acta Inform 22:187–201
4. Chrobak M, Kant G (1997) Convex grid drawings of 3-connected planar graphs. Int J Comput Geom Appl 7:221–223
5. Hopcroft JE, Tarjan RE (1973) Dividing a graph into triconnected components. SIAM J Comput 2:135–158