Skip to main content
SpringerLink
Log in

Centipede graphs and visibility on a cylinder

  • Graphs And Geometry
  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1986)

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

Included in the following conference series:

Abstract

We present a complete characterization of the class of graphs that admit a cylindric visibility representation, where vertices are represented by intervals parallel to the axis of the cylinder so that the edges of the graph correspond to visible intervals. Moreover, we give linear time algorithms for testing the existence of and constructing such a representation.

Research partially supported by the National Science Foundation under grant ECS-84-10902.

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. T. Asano, T. Asano, L. Guibas, J. Hershberger, and H. Imai, “Visibility of Dis-joint Polygons," Algorithmica, vol. 1, no. 1, pp. 49–63, 1986.

    Google Scholar 

  2. S. Even, Graph Algorithms, Computer Science Press, 1979.

    Google Scholar 

  3. M. Garey, D. Johnson, and H. So, “An Application of Graph Coloring to Printed Circuit Testing,” IEEE Trans. on Circuits and Systems, vol. CAS-23, no. 10, pp. 591–598, 1976.

    Google Scholar 

  4. E. Lodi and L. Pagli, “A VLSI Algorithm for a Visibility Problem,” pp. 125–134 in VLSI: Algorithms and Architectures, ed. P. Bertolazzi and F. Luccio, North-Holland, 1985.

    Google Scholar 

  5. M. Schlag, F. Luccio, P. Maestrini, D.T. Lee, and C.K. Wong, “A Visibility Problem in VLSI Layout Compaction,” pp. 259–282 in Advances in Computing Research, vol. 2, ed. F.P. Preparata, JAI Press Inc., 1985.

    Google Scholar 

  6. R. Tamassia and I.G. Tollis, “A Provably Good Linear Algorithm for Embedding Graphs in the Rectilinear Grid,” Technical Report ACT-64, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 1985.

    Google Scholar 

  7. R. Tamassia and I.G. Tollis, “Algorithms for Visibility Representations of Planar Graphs,” Lecture Notes in Computer Science (Proc. STACS ′86), vol. 210, pp. 130–141, Springer-Verlag, 1986.

    Google Scholar 

  8. C. Thomassen, “Plane Representations of Graphs,” pp. 43–69 in Progress in Graph Theory, ed. J.A. Bondy and U.S.R. Murty, Academic Press, 1984.

    Google Scholar 

  9. S.K. Wismath, “Characterizing bar line-of-sight graphs,” Proc. of ACM Symposium on Computational Geometry, Baltimore, Maryland, pp. 147–152, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 61801, Urbana, Illinois

    Roberto Tamassia & Ioannis G. Tollis

Authors
  1. Roberto Tamassia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ioannis G. Tollis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gottfried Tinhofer Gunther Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tamassia, R., Tollis, I.G. (1987). Centipede graphs and visibility on a cylinder. In: Tinhofer, G., Schmidt, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 1986. Lecture Notes in Computer Science, vol 246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17218-1_63

Download citation

  • DOI: https://doi.org/10.1007/3-540-17218-1_63

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17218-5

  • Online ISBN: 978-3-540-47415-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation