Non-crossing paths with geographic constraints

TL;DR

This paper investigates the problem of drawing geographic networks without crossings, focusing on different path constraints, and establishes complexity results for each case, revealing NP-completeness and polynomial-time solvability.

Contribution

It introduces the first complexity analysis of crossing-free drawings in geographic networks with various path shape restrictions.

Findings

NP-complete for straight line paths

Polynomial-time for monotone curve paths

Polynomial solutions under certain conditions for arbitrary paths

Abstract

A geographic network is a graph whose vertices are restricted to lie in a prescribed region in the plane. In this paper we begin to study the following fundamental problem for geographic networks: can a given geographic network be drawn without crossings? We focus on the seemingly simple setting where each region is a vertical segment, and one wants to connect pairs of segments with a path that lies inside the convex hull of the two segments. We prove that when paths must be drawn as straight line segments, it is NP-complete to determine if a crossing-free solution exists, even if all vertical segments have unit length. In contrast, we show that when paths must be monotone curves, the question can be answered in polynomial time. In the more general case of paths that can have any shape, we show that the problem is polynomial under certain assumptions.