Embedding Planar Graphs at Fixed Vertex Locations

  • János Pach
  • Rephael Wenger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1547)


Let G be a planar graph of n vertices, v 1,..., v n , and let p 1,... ,p n be a set of n points in the plane. We present an algorithm for constructing in O(n 2) time a planar embedding of G, where vertex v i is represented by point p i and each edge is represented by a polygonal curve with O(n) bends (internal vertices.) This bound is asymptotically optimal in the worst case. In fact, if G is a planar graph containing at least m pairwise independent edges and the vertices of G are randomly assigned to points in convex position, then, almost surely, every planar embedding of G mapping vertices to their assigned points and edges to polygonal curves has at least m/20 edges represented by curves with at least m/403 bends.


Line Segment Planar Graph Hamiltonian Cycle Internal Vertex Outerplanar 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.


  1. 1.
    Bastert, O., AND Fekete, S. Geometrische Verdrahtungsprobleme. Technical Report 96.247, Angewandte Mathematik und Informatik, Universität zu Köln, Köln, Germany, 1996.Google Scholar
  2. 2.
    Gritzmann, P., Mohar, B., Pach, J., AND Pollack, R. Embedding a planar triangulation with vertices at specified points. American Mathematical Monthly 98 (1991), 165–166. (Solution to problem E3341).Google Scholar
  3. 3.
    Leighton, F. Complexity Issues in VLSI. MIT Press, Cambridge, 1983.Google Scholar
  4. 4.
    Pach, J., AND Agarwal, P. Combinatorial Geometry. John Wiley and Sons, New York, 1995.zbMATHGoogle Scholar
  5. 5.
    Pach, J., Shahrokhi, F., AND Szegedy, M. Applications of the crossing number. Algorithmica 16 (1996), 111–117. (Special Issue on Graph Drawing, edited by G. Di Battista and R. Tamassia).Google Scholar
  6. 6.
    Souvaine, D., AND Wenger, R. Constructing piecewise linear homeomorphisms. Technical Report 94-52, DIMACS, New Brunswick, New Jersey, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • János Pach
    • 1
  • Rephael Wenger
    • 2
  1. 1.City CollegeNew York and the Hungarian Academy of SciencesBudapest
  2. 2.The Ohio State UniversityColumbus

Personalised recommendations