Skip to main content

Universal Line-Sets for Drawing Planar 3-Trees

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7157)

Abstract

A set S of lines is universal for drawing planar graphs with n vertices if every planar graph G with n vertices can be drawn on S such that each vertex of G is drawn as a point on a line of S and each edge is drawn as a straight-line segment without any edge crossing. It is known that \(\lfloor \frac{2(n-1)}{3}\rfloor\) parallel lines are universal for any planar graph with n vertices. In this paper we show that a set of \(\lfloor \frac{n-3}{2} \rfloor +3 \) parallel lines or a set of \(\lceil \frac{n+3}{4} \rceil\) concentric circles are universal for drawing planar 3-trees with n vertices. In both cases we give linear-time algorithms to find such drawings. A by-product of our algorithm is the generalization of the known bijection between plane 3-trees and rooted full ternary trees to the bijection between planar 3-trees and unrooted full ternary trees. We also identify some subclasses of planar 3-trees whose drawings are supported by fewer than \(\lfloor \frac{n-3}{2} \rfloor +3 \) parallel lines.

Keywords

  • Planar Graph
  • Parallel Line
  • Concentric Circle
  • Outer Face
  • Planar Embedding

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bose, P.: On embedding an outer-planar graph in a point set. Computational Geometry: Theory and Applications 23, 2002 (1997)

    MathSciNet  Google Scholar 

  2. Chrobak, M., Nakano, S.-I.: Minimum-width grid drawings of plane graphs. Computational Geometry: Theory and Applications 11(1), 29–54 (1998)

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Demaine, E.D., Schulz, A.: Embedding stacked polytopes on a polynomial-size grid. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, pp. 77–80 (2011)

    Google Scholar 

  4. Dujmović, V., Fellows, M., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F., Whitesides, S., Wood, D.R.: On the parameterized complexity of layered graph drawing. Algorithmica 52(2), 267–292 (2008)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Dujmović, V., Evans, W., Lazard, S., Lenhart, W., Liotta, G., Rappaport, D., Wismath, S.: On point-sets that support planar graph. In: Proceedings of the 19th International Conference on Graph Drawing (to be appeared, 2011)

    Google Scholar 

  6. Dujmović, V., Evans, W., Kobourov, S., Liotta, G., Weibel, C., Wismath, S.: On Graphs Supported by Line Sets. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 177–182. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  7. Estrella-balderrama, A., Fowler, J.J., Kobourov, S.G.: Characterization of unlabeled level planar trees. Computational Geometry: Theory and Applications 42(7), 704–721 (2009)

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Frati, F., Patrignani, M.: A Note on Minimum-Area Straight-Line Drawings of Planar Graphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 339–344. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  9. Mondal, D., Alam, M.J., Rahman, M.S.: Minimum-Layer Drawings of Trees (Extended Abstract). In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS, vol. 6552, pp. 221–232. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  10. Mondal, D., Nishat, R.I., Rahman, M.S., Alam, M.J.: Minimum-area drawings of plane 3-Trees. Journal of Graph Algorithms and Applications 15(1), 177–204 (2011)

    CrossRef  MathSciNet  MATH  Google Scholar 

  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 (in press, 2012)

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Nishizeki, T., Chiba, N.: Planar Graphs: Theory and Algorithms. North Holland Mathematics Studies (1988)

    Google Scholar 

  13. Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. Lecture notes series on computing. World Scientific, Singapore (2004)

    CrossRef  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hossain, M.I., Mondal, D., Rahman, M.S., Salma, S.A. (2012). Universal Line-Sets for Drawing Planar 3-Trees. In: Rahman, M.S., Nakano, Si. (eds) WALCOM: Algorithms and Computation. WALCOM 2012. Lecture Notes in Computer Science, vol 7157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28076-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28076-4_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28075-7

  • Online ISBN: 978-3-642-28076-4

  • eBook Packages: Computer ScienceComputer Science (R0)