# Nearest-Neighbor Decompositions of Drawings

Let π be a set of straight-line segments in the plane, potentially crossing, and let c be a positive integer. We denote by P the union of the endpoints of the straight-line segments of π and of the intersection points between pairs of segments. We say that π has a nearest-neighbor decomposition into c parts if we can partition P into c point sets P_1, β¦, P_c such that π is the union of the nearest neighbor graphs on P_1, β¦, P_c. We show that it is NP-complete to decide whether π can be drawn as the union of cβ₯ 3 nearest-neighbor graphs, even when no two segments cross. We show that for c = 2, it is NP-complete in the general setting and polynomial-time solvable when no two segments cross. We show the existence of an O(log n)-approximation algorithm running in subexponential time for partitioning π into a minimum number of nearest-neighbor graphs. As a main tool in our analysis, we establish the notion of the conflict graph for a drawing π. The vertices of the conflict graph are the connected components of π, with the assumption that each connected component is the nearest neighbor graph of its vertices, and there is an edge between two components U and V if and only if the nearest neighbor graph of U βͺ V contains an edge between a vertex in U and a vertex in V. We show that string graphs are conflict graphs of certain planar drawings. For planar graphs and complete k-partite graphs, we give additional, more efficient constructions. We furthermore show that there are subdivisions of non-planar graphs that are not conflict graphs. Lastly, we show a separator lemma for conflict graphs.

READ FULL TEXT