CGMar 20

The Voronoi Diagram of Four Lines in $\mathbb{R}^3$

arXiv:2603.1983693.51 citationsh-index: 23
AI Analysis

This provides a foundational classification for computational geometry, addressing a specific case in line Voronoi diagrams, which is incremental but essential for understanding higher-dimensional cases.

The paper tackles the problem of classifying the structure of the Voronoi diagram for four lines in 3D Euclidean space, showing that the number of vertices is always even between 0 and 8, and identifying 15 distinct topologies for diagrams without full twists, all of which are realizable.

We consider the Voronoi diagram of lines in $\mathbb{R}^3$ under the Euclidean metric, and give a full classification of its structure in the base case of four lines in general position. We first show that the number of vertices in the Voronoi diagram of four lines in general position is always even, between 0 and 8, and all such numbers can be realized. We identify a key structure for the diagram formation, called a \emph{twist}, which is a pair of consecutive intersections among trisector branches; only two types of twists are possible, so-called \emph{full} and \emph{partial} twists. A full twist is a purely local structure, which can be inserted or removed without affecting the rest of the diagram. Assuming no full twists, the nearest and the farthest Voronoi diagrams of four lines, each have 15 distinct topologies, which are in one-to-one correspondence; the two-dimensional faces are all unbounded, and the total number of vertices is at most six. The unbounded features of the farthest diagram, encoded in a two-dimensional spherical map, are also in one-to-one correspondence. The identified topologies are all realizable. Any Voronoi diagram of four lines in general position in $\mathbb{R}^3$ can be obtained from one of these topologies by inserting full twists; each twist induces a bounded face of exactly two vertices in both the nearest and farthest diagrams. We obtain the classification by an exhaustive search algorithm using some new structural and combinatorial observations of line Voronoi diagrams.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes