Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
A greedily routable region (GRR) is a closed subset of \(\mathbb R^2\), in which each destination point can be reached from each starting point by choosing the direction with maximum reduction of the distance to the destination in each point of the path. Recently, Tan and Kermarrec proposed a geographic routing protocol for dense wireless sensor networks based on decomposing the network area into a small number of interior-disjoint GRRs. They showed that minimum decomposition is NP-hard for polygons with holes.
We consider minimum GRR decomposition for plane straight-line drawings of graphs. Here, GRRs coincide with self-approaching drawings of trees, a drawing style which has become a popular research topic in graph drawing. We show that minimum decomposition is still NP-hard for graphs with cycles, but can be solved optimally for trees in polynomial time. Additionally, we give a 2-approximation for simple polygons, if a given triangulation has to be respected.
- 4.Chazelle, B., Dobkin, D.: Optimal convex decompositions. In: Computational Geometry, pp. 63–133 (1985)Google Scholar
- 8.Dehkordi, H.R., Frati, F., Gudmundsson, J.: Increasing-chord graphs on point sets. J. Graph Algorithms Appl. (2015, to appear). doi:10.7155/jgaa.00348
- 9.Fang, Q., Gao, J., Guibas, L., de Silva, V., Zhang, L.: Glider: gradient landmark-based distributed routing for sensor networks. In: INFOCOM 2005, pp. 339–350. IEEE (2005)Google Scholar
- 16.Nöllenburg, M., Prutkin, R., Rutter, I.: Partitioning graph drawings and triangulated simple polygons into greedily routable regions (2015). CoRR arXiv:1509.05635
- 17.Nöllenburg, M., Prutkin, R., Rutter, I.: On self-approaching and increasing-chord drawings of 3-connected planar graphs. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 476–487. Springer, Heidelberg (2014) Google Scholar
- 18.Tan, G., Bertier, M., Kermarrec, A.M.: Convex partition of sensor networks and its use in virtual coordinate geographic routing. In: INFOCOM 2009, pp. 1746–1754. IEEE (2009)Google Scholar
- 20.Zhu, X., Sarkar, R., Gao, J.: Shape segmentation and applications in sensor networks. In: INFOCOM 2007, pp. 1838–1846. IEEE (2007)Google Scholar