Advertisement

Centipede graphs and visibility on a cylinder

  • Roberto Tamassia
  • Ioannis G. Tollis
Graphs And Geometry
Part of the Lecture Notes in Computer Science book series (LNCS, volume 246)

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.

Keywords

Planar Graph Directed Edge Linear Time Algorithm Topological Function Visibility Graph 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [2]
    S. Even, Graph Algorithms, Computer Science Press, 1979.Google Scholar
  3. [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. [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. [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. [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. [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. [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. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Roberto Tamassia
    • 1
  • Ioannis G. Tollis
    • 1
  1. 1.Coordinated Science LaboratoryUniversity of Illinois at Urbana-ChampaignUrbana

Personalised recommendations