Skip to main content
Springer Nature Link
Log in

Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2009)

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

Included in the following conference series:

  • 890 Accesses

Abstract

A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings. Any outerplanar graph of n vertices with the maximum degree d has a straight-line grid drawing with area O(dn logn). In this paper, we introduce a subclass of outerplanar graphs, which we call label-constrained outerplanar graphs, that admits straight-line grid drawings with O(n logn) area. We give a linear-time algorithm to find such a drawing. We also give a linear-time algorithm for recognition of label-constrained outerplanar graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Brandenburg, F., Eppstein, D., Goodrich, M.T., Kobourov, S., 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)

    Chapter  Google Scholar 

  2. Biedl, T.C.: Drawing outerplanar graphs in O(nlogn) area. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 54–65. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Di Battista, G., Frati, F.: Small area drawings of outerplanar graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 89–100. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Frati, F.: Straight-line drawings of outerplanar graphs in O(dnlogn) area. In: Proc. of the 19th Canadian Conference on Computational Geometry, pp. 225–228 (2007)

    Google Scholar 

  6. Garg, A., Rusu, A.: Area-efficient drawings of outerplanar graphs. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 129–134. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Garg, A., Rusu, A.: A more practical algorithm for drawing binary trees in linear area with arbitrary aspect ratio. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 159–165. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Karim, M.R., Rahman, M.S.: Straight-line grid drawings of planar graphs with linear area. In: Proc. of Asia-pacific Symposium on Visualization, 2007, pp. 109–112. IEEE, Los Alamitos (2007)

    Chapter  Google Scholar 

  9. Karim, M.R., Rahman, M.S.: Four-connected spanning subgraphs of doughnut graphs. In: Nakano, S.-i., Rahman, M. S. (eds.) WALCOM 2008. LNCS, vol. 4921, pp. 132–143. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)

    Book  MATH  Google Scholar 

  11. Schnyder, W.: Embedding planar graphs on the grid. In: Proc. of the First ACM-SIAM Symp. on Discrete Algorithms, San Francisco, pp. 138–148 (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Engineering, Bangladesh University of Engineering and Technology(BUET), Dhaka, 1000, Bangladesh

    Md. Rezaul Karim, Md. Jawaherul Alam & Md. Saidur Rahman

  2. Dept. of Computer Science and Engineering, University of Dhaka, Dhaka, 1000, Bangladesh

    Md. Rezaul Karim

Authors
  1. Md. Rezaul Karim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Md. Jawaherul Alam
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Md. Saidur Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Indian Statistical Institute, 700 108, Kolkata, India

    Sandip Das

  2. Japan Advanced Institute of Science and Technology, 923-1292, Ishikawa, Japan

    Ryuhei Uehara

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karim, M.R., Alam, M.J., Rahman, M.S. (2009). Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract). In: Das, S., Uehara, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2009. Lecture Notes in Computer Science, vol 5431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00202-1_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00202-1_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00201-4

  • Online ISBN: 978-3-642-00202-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics