On Point-Sets That Support Planar Graphs

Dujmovic, Vida and Evans, William and Lazard, Sylvain and Lenhart, William J. and Liotta, Giuseppe and Rappaport, David and Wismath, Stephen (2012) On Point-Sets That Support Planar Graphs. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011, Eindhoven, The Netherlands , pp. 64-74 (Official URL: http://dx.doi.org/ 10.1007/978-3-642-25878-7_7).

Full text not available from this repository.


A universal point-set supports a crossing-free drawing of any planar graph. For a planar graph with n vertices, if bends on edges of the drawing are permitted, universal point-sets of size n are known, but only if the bend-points are in arbitrary positions. If the locations of the bend-points must also be specified as part of the point-set, we prove that any planar graph with n vertices can be drawn on a universal set S of O(n2 / log n) points with at most one bend per edge and with the vertices and the bend points in S. If two bends per edge are allowed, we show that O(n log n) points are sufficient, and if three bends per edge are allowed, Θ(n) points are sufficient. When no bends on edges are permitted, no universal point-set of size o(n2 ) is known for the class of planar graphs.We show that a set of n points in balanced biconvex position supports the class of maximum degree 3 series-parallel lattices.

Item Type:Conference Paper
Additional Information:10.1007/978-3-642-25878-7_7
Classifications:G Algorithms and Complexity > G.490 Embeddings
M Methods > M.600 Planar
ID Code:1241

Repository Staff Only: item control page


Bose, P.: On embedding an outer-planar graph on a point set. Computational Geometry: Theory and Applications 23, 303–312 (2002)

Braß, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. Comput. Geom. 36(2), 117–130 (2007)

Chrobak, M., Karloff, H.: A lower bound on the size of universal sets for planar graphs. SIGACT News 20(4), 83–86 (1989)

de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10, 41–51 (1990)

Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, NJ (1999)

Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Curve-constrained drawings of planar graphs. Computational Geometry 30, 1–23 (2005)

Everett, H., Lazard, S., Liotta, G., Wismath, S.: Universal sets of n points for one-bend drawings of planar graphs with n vertices. Discrete and Computational Geometry 43(2), 272–288 (2010)

Gritzmann, P., Mohar, B., Pach, J., Pollack, R.: Embedding a planar triangulation with vertices at specified points. Amer. Math. Monthly 98(2), 165–166 (1991)

Kaufmann, M., Wiese, R.: Embedding vertices at points: Few bends suffice for planar graphs. Journal of Graph Algorithms and Applications 6(1), 115–129 (2002)

Kurowski, M.: A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs. Inf. Process. Lett. 92(2), 95–98 (2004)

Schnyder, W.: Embedding planar graphs on the grid. In: Proc. 1st ACM-SIAM Sympos. Discrete Algorithms (SODA 1990), pp. 138–148 (1990)

Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series-parallel digraphs. SIAM J. Comput. 11(2), 298–313 (1982)