Abstract
Let \(\mathcal D\) be a set of disks and G be the intersection graph of \(\mathcal D\). A drawing of G is obedient to \(\mathcal D\) if every vertex is placed in its corresponding disk. We show that deciding whether a set of unit disks \(\mathcal D\) has an obedient plane straight-line drawing is \(\mathcal {NP}\)-hard regardless of whether a combinatorial embedding is prescribed or an arbitrary embedding is allowed. We thereby strengthen a result by Evans et al., who show \(\mathcal {NP}\)-hardness for disks with arbitrary radii in the arbitrary embedding case. Our result for the arbitrary embedding case holds true even if G is thinnish, that is, removing all triangles from G leaves only disjoint paths. This contrasts another result by Evans et al. stating that the decision problem can be solved in linear time if \(\mathcal D\) is a set of unit disks and G is thin, that is, (1) the (graph) distance between any two triangles is larger than 48 and (2) removal of all disks within (graph) distance 8 of a triangle leaves only isolated paths. A path in a disk intersection graph is isolated if for every pair A, B of disks that are adjacent along the path, the convex hull of \(A\cup B\) is intersected only by disks adjacent to A or B. Our reduction can also guarantee the triangle separation property (1). This leaves only a small gap between tractability and \(\mathcal {NP}\)-hardness, tied to the path isolation property (2) in the neighborhood of triangles. It is therefore natural to study the impact of different restrictions on the structure of triangles. As a positive result, we show that an obedient plane straight-line drawing is always possible if all triangles in G are light and the disks are in general position (no three centers collinear). A triangle in a disk intersection graph is light if all its vertices have degree at most three or the common intersection of the three corresponding disks is empty. We also provide an efficient drawing algorithm for that scenario.
B. Banyassady — supported by DFG project MU/3501-2
M. Löffler — supported by the Netherlands Organisation for Scientific Research (NWO) under project no. 639.021.123 and 614.001.504
T. Miltzow — supported by the ERC grant PARAMTIGHT: "Parameterized complexity and the search for tight complexity results", no. 280152
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abrahamsen, M., Adamaszek, A., Miltzow, T.: Irrational guards are sometimes needed (2017). arXiv preprint arxiv:1701.05475
Angelini, P., Lozzo, G., Bartolomeo, M., Battista, G., Hong, S.-H., Patrignani, M., Roselli, V.: Anchored drawings of planar graphs. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 404–415. Springer, Heidelberg (2014). doi:10.1007/978-3-662-45803-7_34
Bajaj, C.: The algebraic degree of geometric optimization problems. Discrete & Computational Geometry 3(2), 177–191 (1988)
de Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geometry Appl. 22(3), 187–206 (2012)
Bose, P., Morin, P., Stojmenović, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks 7(6), 609–616 (2001)
Cardinal, J.: Computational geometry column 62. SIGACT News 46(4), 69–78 (2015)
Evans, W., Kirkpatrick, D., Löffler, M., Staals, F.: Minimizing co-location potential of moving entities. SIAM J. Comput. 45(5), 1870–1893 (2016)
Evans, W.S., van Garderen, M., Löffler, M., Polishchuk, V.: Recognizing a DOG is hard, but not when it is thin and unit. In: FUN 2016, pp. 16: 1–16: 12 (2016)
Keszegh, B., Pach, J., Pálvölgyi, D.: Drawing planar graphs of bounded degree with few slopes. SIAM Journal on Discrete Mathematics 27(2), 1171–1183 (2013)
Kröller, A., Fekete, S.P., Pfisterer, D., Fischer, S.: Deterministic boundary recognition and topology extraction for large sensor networks. In: SoDA 2006, pp. 1000–1009 (2006)
Kuhn, F., Moscibroda, T., Wattenhofer, R.: Unit disk graph approximation. In: Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing, pp. 17–23. ACM (2004)
Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: of theory and practice. In: PoDC, pp. 63–72 (2003)
Löffler, M.: Data Imprecision in Computational Geometry. Ph.D. thesis, Utrecht University (2009)
Matoušek, J.: Intersection graphs of segments and \(\exists \mathbb{R}\) (2014). arXiv preprint arxiv:1406.2636
Wang, Y., Gao, J., Mitchell, J.S.B.: Boundary recognition in sensor networks by topological methods. In: MobiCom 2006, pp. 122–133 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Banyassady, B., Hoffmann, M., Klemz, B., Löffler, M., Miltzow, T. (2017). Obedient Plane Drawings for Disk Intersection Graphs. In: Ellen, F., Kolokolova, A., Sack, JR. (eds) Algorithms and Data Structures. WADS 2017. Lecture Notes in Computer Science(), vol 10389. Springer, Cham. https://doi.org/10.1007/978-3-319-62127-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-62127-2_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62126-5
Online ISBN: 978-3-319-62127-2
eBook Packages: Computer ScienceComputer Science (R0)