Every Graph Admits an Unambiguous Bold Drawing

  • János Pach
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7034)


Let r and w be a fixed positive numbers, w < r. In a bold drawing of a graph, every vertex is represented by a disk of radius r, and every edge by a narrow rectangle of width w. We solve a problem of van Kreveld [K09] by showing that every graph admits a bold drawing in which the region occupied by the union of the disks and rectangles representing the vertices and edges does not contain any disk of radius r other than the ones representing the vertices.


Maximum Radius Convex Curve Planar Partition Graph Drawing Tional Geometry 
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. [BGR04]
    Barequet, G., Goodrich, M.T., Riley, C.: Drawing planar graphs with large vertices and thick edges. J. Graph Algorithms Appl. 8, 3–20 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  2. [CE92]
    Chazelle, B., Edelsbrunner, H.: An optimal algorithm for intersecting line segments in the plane. J. ACM 39, 1–54 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  3. [CS89]
    Clarkson, K.L., Shor, P.W.: Application of random sampling in computational geometry, II. Discrete & Computational Geometry 4, 387–421 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  4. [DEKW06]
    Duncan, C.A., Efrat, A., Kobourov, S.G., Wenk, C.: Drawing with fat edges. Int. J. Found. Comput. Sci. 17, 1143–1164 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  5. [ES35]
    Erdős, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Mathematica 2, 463–470 (1935)MathSciNetzbMATHGoogle Scholar
  6. [GRS90]
    Graham, R., Rothschild, B., Spencer, J.H.: Ramsey Theory. John Wiley and Sons, New York (1990)zbMATHGoogle Scholar
  7. [K09]
    van Kreveld, M.: Bold graph drawings. In: Proc. Canadian Conference on Computational Geometry, CCCG 2009 (2009),; Also Computational Geometry: Theory & Applications (to appear)
  8. [M88]
    Mulmuley, K.: A fast planar partition algorithm, I. In: Proc. 29th FOCS, pp. 580–589 (1988)Google Scholar
  9. [N04]
    North, S.C.: Drawing Graphs with Neato (2004),
  10. [R30]
    Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc. Series 30(2), 264–286 (1930)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • János Pach
    • 1
  1. 1.EPFL, Lausanne and Rényi InstituteBudapestHungary

Personalised recommendations