Nearest-Neighbor Decompositions of Drawings

by   Jonas Cleve, et al.

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.


page 1

page 2

page 3

page 4

βˆ™ 08/04/2017

Geometric Embedding of Path and Cycle Graphs in Pseudo-convex Polygons

Given a graph G with n vertices and a set S of n points in the p...
βˆ™ 03/30/2021

Approximate Nearest-Neighbor Search for Line Segments

Approximate nearest-neighbor search is a fundamental algorithmic problem...
βˆ™ 02/28/2019

Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs

A connected component of a vertex-coloured graph is said to be colourful...
βˆ™ 02/19/2019

Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains

We show new applications of the nearest-neighbor chain algorithm, a tech...
βˆ™ 04/14/2020

Online Graph Exploration on Trees, Unicyclic Graphs and Cactus Graphs

We study the problem of exploring all vertices of an undirected weighted...
βˆ™ 03/17/2019

Circumscribing Polygons and Polygonizations for Disjoint Line Segments

Given a planar straight-line graph G=(V,E) in R^2, a circumscribing poly...
βˆ™ 02/04/2023

Rank-based linkage I: triplet comparisons and oriented simplicial complexes

Rank-based linkage is a new tool for summarizing a collection S of objec...

Please sign up or login with your details

Forgot password? Click here to reset