A Linear-Size Well-Separated Pair Decomposition for Unit Disk Graphs

Given a metric space $(X, d)$ a $c$-well separated pair decomposition (WSPD) is a collection of `dumbbell' pairs of subsets $(A, B)$, $A, B\subseteq X$, where the distance between the two sets is at least $c$ times the diameter of each set and every pair of points in $X$ is covered by one such pair. It is known that for a weighted unit disk graph metric of $n$ points, there is a WSPD of size $O(n\log n)$. But it is open whether this bound can be improved to $O(n)$. In this note, we answer this question affirmatively and provide an algorithm that yields a linear-size WSPD for unit disk graphs.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-17
DOI
https://doi.org/10.48550/arxiv.2611.22049
Primary Topic
Computational Geometry and Mesh Generation
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A Linear-Size Well-Separated Pair Decomposition for Unit Disk Graphs

Jie Gao
arXiv (Cornell University)
Computational Geometry and Mesh Generation
preprint

A Linear-Size Well-Separated Pair Decomposition for Unit Disk Graphs

Jie Gao
preprint en

Abstract

Given a metric space $(X, d)$ a $c$-well separated pair decomposition (WSPD) is a collection of `dumbbell' pairs of subsets $(A, B)$, $A, B\subseteq X$, where the distance between the two sets is at least $c$ times the diameter of each set and every pair of points in $X$ is covered by one such pair. It is known that for a weighted unit disk graph metric of $n$ points, there is a WSPD of size $O(n\log n)$. But it is open whether this bound can be improved to $O(n)$. In this note, we answer this question affirmatively and provide an algorithm that yields a linear-size WSPD for unit disk graphs.

arXiv (Cornell University)
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon