Answers are grounded in this paper and cite their sources.
We prove that every connected Euclidean-weighted unit-disk graph on n vertices has a (1/ε)-well-separated pair decomposition of size O(nε⁻²log(1/ε)). This resolves an open problem posed by Gao and Zhang in 2003. We also show that this bound is tight: there are connected unit-disk graphs for which any (1/ε)-well-separated pair decomposition has size Ω(nε⁻²log (1/ε)).
No takes yet. Share an insight, caveat, or question.
Berg et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: