Snapping Graph Drawings to the Grid Optimally
In geographic information systems and in the production of digital maps for small devices with restricted computational resources one often wants to round coordinates to a rougher grid. This removes unnecessary detail and reduces space consumption as well as computation time. This process is called snapping to the grid and has been investigated thoroughly from a computational-geometry perspective. In this paper we investigate the same problem for given drawings of planar graphs under the restriction that their combinatorial embedding must be kept and edges are drawn straight-line. We show that the problem is NP-hard for several objectives and provide an integer linear programming formulation. Given a plane graph G and a positive integer w, our ILP can also be used to draw G straight-line on a grid of width w and minimum height (if possible).
KeywordsInteger Linear Program Cyclic Order Integer Linear Programming Formulation Graph Drawing Polygonal Chain
We thank Gergely Mincsovics for suggesting this problem to us.
- 10.Löffler, A., van Dijk, T.C., Wolff, A.: Snapping graph drawings to the grid optimally. Arxiv report arXiv.org/abs/1608.08844 (2016)
- 11.McCarl, B.A., Spreen, T.H.: Applied mathematical programming using algebraic systems. Texas A&M University (1997)Google Scholar
- 12.Nöllenburg, M.: Automated drawing of metro maps. Master’s thesis, Fakultät für Informatik, Universität Karlsruhe (2005). http://www.ubka.uni-karlsruhe.de/indexer-vvv/ira/2005/25
- 14.Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of 1st ACM-SIAM Symposium on Discrete Algorithms (SODA 1990), pp. 138–148 (1990)Google Scholar