Skip to main content
SpringerLink
Log in

A more compact visibility representation

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 790))

Included in the following conference series:

Abstract

In this paper we present a linear time and space algorithm for constructing a visibility representation of a planar graph on an (⌊3/2n⌋−3)×(n−1) grid, thereby improving the previous bound of (2n−5)×(n−1). To this end we build in linear time the 4-block tree of a triangulated planar graph.

This work was supported by ESPRIT Basic Research Action No. 7141 (project ALCOM II: Algorithms and Complexity). Part of this work was done while visiting the Graph Theory workshop at the Bellairs Research Institute of McGill University (Montreal), Feb. 12–19, 1993.

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.

References

  1. Bertolazzi, P., R.F. Cohen, G. Di Battista, R. Tamassia and I.G. Tollis, How to draw a series-parallel graph, in: O. Nurmi and E. Ukkonen (Eds.), Proc. Scand. Workshop on Algorithm Theory (SWAT'92), Lecture Notes in Computer Science 621, Springer-Verlag, 1992, pp. 272–283.

    Google Scholar 

  2. Chiba, N., and T. Nishizeki, Arboricity and subgraph listing algorithms, SIAM J. Comput. 14 (1985), pp. 210–223.

    Google Scholar 

  3. Di Battista, G., Eades, P., and R. Tamassia, I.G. Tollis, Algorithms for Automatic Graph Drawing: An Annotated Bibliography, Dept. of Comp. Science, Brown Univ., Technical Report, 1993.

    Google Scholar 

  4. Di Battista, G., R. Tamassia and I.G. Tollis, Area requirement and symmetry display in drawing graphs, Discrete and Comp. Geometry 7 (1992), pp. 381–401.

    Google Scholar 

  5. Di Battista, G., R. Tamassia and I.G. Tollis, Constrained visibility representations of graphs, Inform. Process. Letters 41 (1992), pp. 1–7.

    Google Scholar 

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

    Google Scholar 

  7. Harary, F., Graph Theory, Addison-Wesley Publishing Company, Inc., Reading, Mass., 1972.

    Google Scholar 

  8. Hopcroft, J., and R.E. Tarjan, Dividing a graph into triconnected components, SIAM J. Comput. 2 (1973), pp. 135–158.

    Google Scholar 

  9. Kanevsky, A., R. Tamassia, G. Di Battista and J. Chen, On-line maintenance of the four-connected components of a graph, in: Proc. 32th Annual IEEE Symp. on Found. of Comp. Science, Puerto Rico, 1991, pp. 793–801.

    Google Scholar 

  10. Kant, G., Drawing planar graphs using the lmc-ordering, Proc. 33th Ann. IEEE Symp. on Found. of Comp. Science, Pittsburgh, 1992, pp. 101–110. Revised and extended version in

    Google Scholar 

  11. Kant, G., Algorithms for Drawing Planar Graphs, PhD thesis, Dept. of Computer Science, Utrecht University, 1993.

    Google Scholar 

  12. Kant, G., On triangulating planar graphs, submitted to Information and Computation, 1993.

    Google Scholar 

  13. Kant, G., and X. He, Two Algorithms for Finding Rectangular Duals of Planar Graphs, Tech. Report RUU-CS-92-41, Dept. of Computer Science, Utrecht University, 1992.

    Google Scholar 

  14. Nummenmaa, J.; Constructing compact rectilinear planar layouts using canonical representation of planar graphs, Theoret. Comp. Science 99 (1992), pp. 213–230.

    Google Scholar 

  15. Otten, R.H.J.M., and J.G. van Wijk, Graph representation in interactive layout design, in: Proc. IEEE Int. Symp. on Circuits and Systems, 1978, pp. 914–918.

    Google Scholar 

  16. Read, R.C., A new method for drawing a graph given the cyclic order of the edges at each vertex, Congr. Numer. 56 (1987), pp. 31–44.

    Google Scholar 

  17. Richards, D., Finding short cycles in planar graphs using separators, J. Alg. 7 (1986), pp. 382–394.

    Google Scholar 

  18. Rosenstiehl, P., and R.E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discr. and Comp. Geometry 1 (1986), pp. 343–353.

    Google Scholar 

  19. Tamassia, R., and I.G. Tollis, A unified approach to visibility representations of planar graphs, Discr. and Comp. Geometry 1 (1986), pp. 321–341.

    Google Scholar 

  20. Tamassia, R., and I.G. Tollis, Planar grid embedding in linear time, IEEE Trans. Circuits and Systems 36 (1989), pp. 1230–1234.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Utrecht University, Padualaan 14, 3584, CH Utrecht, the Netherlands

    Goos Kant

Authors
  1. Goos Kant
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kant, G. (1994). A more compact visibility representation. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1993. Lecture Notes in Computer Science, vol 790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57899-4_70

Download citation

  • DOI: https://doi.org/10.1007/3-540-57899-4_70

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57899-4

  • Online ISBN: 978-3-540-48385-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation