# Geodesic Obstacle Representation of Graphs

@article{Bose2018GeodesicOR, 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}, journal={ArXiv}, year={2018}, volume={abs/1803.03705} }

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

One Citation

A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution

- Computer Science, Mathematics
- 2018

- 6
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 22 REFERENCES

Grid-Obstacle Representations with Connections to Staircase Guarding

- Mathematics, Computer Science
- 2017

- 2
- PDF