Obedient plane drawings for disk intersection graphs

Let D be a set of disks and G be the intersection graph of D. A drawing of G is obedient to D if every vertex is placed in its corresponding disk. We show that deciding whether a set of unit disks D has an obedient plane straightline drawing is 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 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 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 ∪ 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 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.SCOPUS: cp.k