Plane 3-trees: Embeddability and Approximation

(Extended Abstract)
  • Stephane Durocher
  • Debajyoti Mondal
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8037)


We give an O(nlog3 n)-time linear-space algorithm that, given a plane 3-tree G with n vertices and a set S of n points in the plane, determines whether G has a point-set embedding on S (i.e., a planar straight-line drawing of G where each vertex is mapped to a distinct point of S), improving the O(n 4/3 + ε )-time O(n 4/3)-space algorithm of Moosa and Rahman. Given an arbitrary plane graph G and a point set S, Di Giacomo and Liotta gave an algorithm to compute 2-bend point-set embeddings of G on S using O(W 3) area, where W is the length of the longest edge of the bounding box of S. Their algorithm uses O(W 3) area even when the input graphs are restricted to plane 3-trees. We introduce new techniques for computing 2-bend point-set embeddings of plane 3-trees that takes only O(W 2) area. We also give approximation algorithms for point-set embeddings of plane 3-trees. Our results on 2-bend point-set embeddings and approximate point-set embeddings hold for partial plane 3-trees (e.g., series-parallel graphs and Halin graphs).


Convex Hull Planar Graph Straight Line Segment Outerplanar Graph Valid Mapping 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Schnyder, W.: Embedding planar graphs on the grid. In: SODA, pp. 138–148. ACM (1990)Google Scholar
  3. 3.
    Bose, P.: On embedding an outer-planar graph in a point set. Computational Geometry: Theory and Applications 23(3), 303–312 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Cabello, S.: Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. Journal of Graph Algorithms and Applications 10(2), 353–363 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Ikebe, Y., Perles, M.A., Tamura, A., Tokunaga, S.: The rooted tree embedding problem into points in the plane. Discrete & Comp. Geometry 11(1), 51–63 (1994)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Bose, P., McAllister, M., Snoeyink, J.: Optimal algorithms to embed trees in a point set. Journal of Graph Algorithms and Applications 1(2), 1–15 (1997)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Castañeda, N., Urrutia, J.: Straight line embeddings of planar graphs on point sets. In: CCCG, pp. 312–318 (1996)Google Scholar
  8. 8.
    Durocher, S., Mondal, D.: On the hardness of point-set embeddability. In: Rahman, M.S., Nakano, S.-I. (eds.) WALCOM 2012. LNCS, vol. 7157, pp. 148–159. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  9. 9.
    Biedl, T., Vatshelle, M.: The point-set embeddability problem for plane graphs. In: SoCG, pp. 41–50. ACM (2012)Google Scholar
  10. 10.
    Andrade Jr., J.S., Herrmann, H.J., Andrade, R.F.S., da Silva, L.R.: Apollonian networks: Simultaneously scale-free, small world, euclidean, space filling, and with matching graphs. Physical Review Letters 94 (2005)Google Scholar
  11. 11.
    Nishat, R.I., Mondal, D., Rahman, M.S.: Point-set embeddings of plane 3-trees. Computational Geometry: Theory and Applications 45(3), 88–98 (2012)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Durocher, S., Mondal, D., Nishat, R.I., Rahman, M.S., Whitesides, S.: Embedding plane 3-trees in ℝ2 and ℝ3. In: Speckmann, B. (ed.) GD 2011. LNCS, vol. 7034, pp. 39–51. Springer, Heidelberg (2011)Google Scholar
  13. 13.
    Moosa, T.M., Sohel Rahman, M.: Improved algorithms for the point-set embeddability problem for plane 3-trees. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol. 6842, pp. 204–212. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  14. 14.
    Erickson, J.: On the relative complexities of some geometric problems. In: CCCG, pp. 85–90 (1995)Google Scholar
  15. 15.
    Brandenburg, F.J., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Liotta, G., Mutzel, P.: Selected open problems in graph drawing. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 515–539. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  16. 16.
    Everett, H., Lazard, S., Liotta, G., Wismath, S.K.: Universal sets of n points for one-bend drawings of planar graphs with n vertices. Discrete & Computational Geometry 43(2), 272–288 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  17. 17.
    Kaufmann, M., Wiese, R.: Embedding vertices at points: Few bends suffice for planar graphs. J. of Graph Algorithms and Applications 6(1), 115–129 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    Di Giacomo, E., Liotta, G.: The Hamiltonian augmentation problem and its applications to graph drawing. In: Rahman, M. S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 35–46. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  19. 19.
    Chazelle, B., Sharir, M., Welzl, E.: Quasi-optimal upper bounds for simplex range searching and new zone theorems. Algorithmica 8(5&6), 407–429 (1992)MathSciNetzbMATHCrossRefGoogle Scholar
  20. 20.
    Steiger, W.L., Streinu, I.: Illumination by floodlights. Computational Geometry: Theory and Applications 10(1), 57–70 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  21. 21.
    Overmars, M.H., van Leeuwen, J.: Maintenance of configurations in the plane. Journal of Computer and System Sciences 23(2), 166–204 (1981)MathSciNetzbMATHCrossRefGoogle Scholar
  22. 22.
    Brodal, G.S., Jacob, R.: Dynamic planar convex hull. In: FOCS, pp. 617–626. IEEE (2002)Google Scholar
  23. 23.
    Dilworth, R.P.: A decomposition theorem for partially ordered sets. Annals of Mathematics 51(1), 161–166 (1950)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Stephane Durocher
    • 1
  • Debajyoti Mondal
    • 1
  1. 1.Department of Computer ScienceUniversity of ManitobaCanada

Personalised recommendations