Greedy Rectilinear Drawings
A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, in which each edge is either a horizontal or a vertical segment. These drawings have several properties that improve human readability and support network routing. We address the problem of testing whether a planar rectilinear representation, i.e., a plane graph with specified vertex angles, admits vertex coordinates that define a greedy drawing. We provide a characterization, a linear-time testing algorithm, and a full generative scheme for universal greedy rectilinear representations, i.e., those for which every drawing is greedy. For general greedy rectilinear representations, we give a combinatorial characterization and, based on it, a polynomial-time testing and drawing algorithm for a meaningful subset of instances.
- 2.Angelini, P., et al.: Greedy rectilinear drawings. Arxiv report 1808.09063 (2018). http://arxiv.org/abs/1808.09063
- 7.Da Lozzo, G., D’Angelo, A., Frati, F.: On planar greedy drawings of 3-connected planar graphs. In: Aronov, B., Katz, M.J. (eds.) Proceedings 33rd International Symposium on Computational Geometry (SoCG 2017). LIPIcs, vol. 77, pp. 33:1–33:16 (2017). https://doi.org/10.4230/LIPIcs.SoCG.2017.33
- 10.Duncan, C.A., Goodrich, M.T.: Planar orthogonal and polyline drawing algorithms. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization. Chapman and Hall/CRC (2013). https://cs.brown.edu/~rt/gdhandbook/
- 22.Rao, A., Papadimitriou, C.H., Shenker, S., Stoica, I.: Geographic routing without location information. In: Johnson, D.B., Joseph, A.D., Vaidya, N.H. (eds.) Proceedings of 9th Annual International Conference on Mobile Computing and Networking (MOBICOM 2003), pp. 96–108. ACM (2003). https://doi.org/10.1145/938985.938996