Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher

TL;DR

This paper advances the understanding of diameter computation in high-dimensional geometric intersection graphs by providing new algorithms and lower bounds for 3D objects, highlighting differences between unit cubes and balls.

Contribution

It introduces the first truly subquadratic algorithm for Diameter-3 of unit cubes in 3D and establishes a lower bound for unit balls, expanding the computational landscape in higher dimensions.

Findings

Subquadratic algorithm for Diameter-3 of 3D unit cubes

Subquadratic lower bound for Diameter-3 of 3D unit balls under OV hypothesis

Near-linear algorithm for Diameter-2 of 3D unit cubes

Abstract

Recent research on computing the diameter of geometric intersection graphs has made significant strides, primarily focusing on the 2D case where truly subquadratic-time algorithms were given for simple objects such as unit-disks and (axis-aligned) squares. However, in three or higher dimensions, there is no known truly subquadratic-time algorithm for any intersection graph of non-trivial objects, even basic ones such as unit balls or (axis-aligned) unit cubes. This was partially explained by the pioneering work of Bringmann et al. [SoCG '22] which gave several truly subquadratic lower bounds, notably for unit balls or unit cubes in 3D when the graph diameter $\Delta$ is at least $\Omega(\log n)$, hinting at a pessimistic outlook for the complexity of the diameter problem in higher dimensions. In this paper, we substantially extend the landscape of diameter computation for objects in three and higher dimensions, giving a few positive results. Our highlighted findings include: - A truly subquadratic-time algorithm for deciding if the diameter of unit cubes in 3D is at most 3 (Diameter-3 hereafter), the first algorithm of its kind for objects in 3D or higher dimensions. Our algorithm is based on a novel connection to pseudolines, which is of independent interest. - A truly subquadratic time lower bound for \Diameter-3 of unit balls in 3D under the Orthogonal Vector (OV) hypothesis, giving the first separation between unit balls and unit cubes in the small diameter regime. Previously, computing the diameter for both objects was known to be truly subquadratic hard when the diameter is $\Omega(\log n)$. - A near-linear-time algorithm for Diameter-2 of unit cubes in 3D, generalizing the previous result for unit squares in 2D. - A truly subquadratic-time algorithm and lower bound for Diameter-2 and Diameter-3 of rectangular boxes (of arbitrary dimension and sizes), respectively.