A Well-Separated Pair Decomposition of Linear Size for Unit-Disk Graphs
We prove that every connected Euclidean-weighted unit-disk graph on $n$ vertices has a $(1/\varepsilon)$-well-separated pair decomposition of size $O(n\varepsilon^{-2}\log(1/\varepsilon))$. 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/\varepsilon)$-well-separated pair decomposition has size $Ω(n\varepsilon^{-2}\log (1/\varepsilon))$.
Authors
- Mark de Berg (ORCID: https://orcid.org/0000-0001-5770-3784)
- Sampson Wong (ORCID: https://orcid.org/0000-0003-3803-3804)
- Joachim Gudmundsson (ORCID: https://orcid.org/0000-0002-6778-7990)
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.48550/arxiv.2611.24295
- Primary Topic
- Computational Geometry and Mesh Generation
- Type
- preprint