Discrete & Computational Geometry

, Volume 12, Issue 3, pp 347–365 | Cite as

Can visibility graphs Be represented compactly?

  • P. K. Agarwal
  • N. Alon
  • B. Aronov
  • S. Suri


We consider the problem of representing the visibility graph of line segments as a union of cliques and bipartite cliques. Given a graphG, a familyG={G1,G2,...,G k } is called aclique cover ofG if (i) eachG i is a clique or a bipartite clique, and (ii) the union ofG i isG. The size of the clique coverG is defined as ∑ i=1 k n i , wheren i is the number of vertices inG i . Our main result is that there are visibility graphs ofn nonintersecting line segments in the plane whose smallest clique cover has size Ω(n2/log2n). An upper bound ofO(n2/logn) on the clique cover follows from a well-known result in extremal graph theory. On the other hand, we show that the visibility graph of a simple polygon always admits a clique cover of sizeO(nlog3n), and that there are simple polygons whose visibility graphs require a clique cover of size Ω(n logn).


Line Segment Discrete Comput Geom Simple Polygon Visibility Graph Quadratic Number 
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.


  1. 1.
    P. Agarwal, M. Sharir, and S. Toledo, Applications of parametric searching in geometric optimization,J. Algorithms (1993), to appear.Google Scholar
  2. 2.
    A. Aggarwal and S. Suri, The biggest diagonal in a simple polygon,Inform. Process. Lett. 35 (1990), 13–18.zbMATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    N. Alon and J. H. Spencer,The Probabilistic Method, Wiley, New York, 1991.Google Scholar
  4. 4.
    B. Chazelle, A polygon cutting theorem,Proc. 23rd IEEE Symp. on Foundations of Computer Science, 1982, pp. 339–349.Google Scholar
  5. 5.
    B. Chazelle, Lower bounds on the complexity of polytope range searching,J. Amer. Math. Soc.,2 (1989), 637–666.zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    B. Chazelle, Lower bounds for the orthogonal range searching: II. The arithmetic model,J Assoc. Comput. Mach. 37 (1990), 439–463.zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, Algorithms for bichromatic line segment problems and polyhedral terrains.Algorithmica 11 (1994), 116–132.zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    B. Chazelle and L. Guibas, Visibility and intersection problems in plane geometry,Discrete Comput. Geom. 4 (1989), 551–589.zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    B. Chazelle and B. Rosenberg, The complexity of computing partial sums off-line,Internat. J. Comput. Geom. Appl. 1 (1991), 33–46.zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    P. Erdős and P. Turán, On a problem of Sidon in additive number theory, and on some related problems,Proc. London Math. Soc. 16 (1941), 212–215.CrossRefGoogle Scholar
  11. 11.
    M. L. Fredman, A lower bound on the complexity of orthogonal range queries,J. Assoc. Comput. Mach. 28 (1981), 696–705.zbMATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    S. Ghosh and D. Mount, An output-sensitive algorithm for computing visibility graphs,SIAM J. Comput. 20 (1991), 888–910.zbMATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    G. Hardy and E. Wright,An Introduction to the Theory of Numbers, Oxford University Press, London 1959.Google Scholar
  14. 14.
    G. Katona and E. Szemerédi, On a problem in a graph theory,Studia Sci. Math. Hungar. 2 (1967), 23–28.zbMATHMathSciNetGoogle Scholar
  15. 15.
    J. Singer, A theorem in finite projective geometry and some applications to number theory,Trans. Amer. Math. Soc. 43 (1938), 377–385.MathSciNetCrossRefGoogle Scholar
  16. 16.
    Z. Tuzua, Covering of graphs by complete bipartite subgraphs: complexity of 0–1 matrices,Combinatorica 4 (1984), 111–116.MathSciNetCrossRefGoogle Scholar
  17. 17.
    E. Welzl, Constructing the visibility graph forn line segments inO(n 2) time,Inform. Process. Lett. 20 (1985), 167–171.zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag New York Inc. 1994

Authors and Affiliations

  • P. K. Agarwal
    • 1
  • N. Alon
    • 2
    • 4
  • B. Aronov
    • 3
  • S. Suri
    • 4
  1. 1.Department of Computer ScienceDuke UniversityDurhamUSA
  2. 2.Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact SciencesTel Aviv UniversityTel AvivIsrael
  3. 3.Computer Science DepartmentPolytechnic University, Six Metro Tech CenterBrooklynUSA
  4. 4.Bell Communications ResearchMorristownUSA

Personalised recommendations