Geodesic Obstacle Representation of Graphs

  title={Geodesic Obstacle Representation of Graphs},
  author={P. Bose and Paz Carmi and V. Dujmovic and S. Mehrabi and Fabrizio Montecchiani and P. Morin and Lu{\'i}s Fernando Schultz Xavier da Silveira},
  • P. Bose, Paz Carmi, +4 authors Luís Fernando Schultz Xavier da Silveira
  • Published 2018
  • Mathematics, Computer Science
  • ArXiv
  • An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such that the straight-line segment connecting the points corresponding to two vertices does not intersect any obstacles if and only if the vertices are adjacent in the graph. The obstacle representation and its plane variant (in which the resulting representation is a plane straight-line embedding of the graph) have been extensively studied… CONTINUE READING

    Figures and Topics from this paper.

    A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution
    • 6
    • PDF


    Publications referenced by this paper.
    Obstacle Numbers of Graphs
    • 28
    • PDF
    On the Structure of Graphs with Low Obstacle Number
    • 16
    • PDF
    Drawing Graphs Using a Small Number of Obstacles
    • 6
    • PDF
    Lower Bounds on the Obstacle Number of Graphs
    • 14
    • PDF
    Grid-Obstacle Representations with Connections to Staircase Guarding
    • 2
    • PDF
    Graphs with no grid obstacle representation
    • 4
    • PDF
    Graph Drawings with no k Pairwise Crossing Edges
    • P. Valtr
    • Mathematics, Computer Science
    • 1997
    • 51
    • PDF
    Obstacle Numbers of Planar Graphs
    • 1
    • PDF
    Drawing planar graphs using the canonical ordering
    • G. Kant
    • Mathematics, Computer Science
    • 2005
    • 136
    • PDF