TY - JOUR

T1 - Balanced line separators of unit disk graphs

AU - Carmi, Paz

AU - Chiu, Man Kwun

AU - Katz, Matthew J.

AU - Korman, Matias

AU - Okamoto, Yoshio

AU - van Renssen, André

AU - Roeloffzen, Marcel

AU - Shiitada, Taichi

AU - Smorodinsky, Shakhar

N1 - Funding Information:
A preliminary version was presented at 15th Algorithms and Data Structures Symposium (WADS 2017). Chiu, van Renssen and Roeloffzen were supported by JST ERATO Grant Number JPMJER1201, Japan. Chiu was also supported by ERC STG 757609. Korman was partially supported by MEXT KAKENHI No. 17K12635 and the NSF award CCF-1422311. Katz was partially supported by grant 1884/16 from the Israel Science Foundation. Okamoto was partially supported by KAKENHI Grant Numbers JP24106005, JP24220003 and JP15K00009, JST CREST Grant Number JPMJCR1402, and Kayamori Foundation for Informational Science Advancement Grant Number K28-XXI-481. Smorodinsky's research was partially supported by Grant 635/16 from the Israel Science Foundation.
Publisher Copyright:
© 2019 Elsevier B.V.

PY - 2020/1

Y1 - 2020/1

N2 - We prove a geometric version of the graph separator theorem for the unit disk intersection graph: for any set of n unit disks in the plane there exists a line ℓ such that ℓ intersects at most O((m+n)logn) disks and each of the halfplanes determined by ℓ contains at most 2n/3 unit disks from the set, where m is the number of intersecting pairs of disks. We also show that an axis-parallel line intersecting O(m+n) disks exists, but each halfplane may contain up to 4n/5 disks. We give an almost tight lower bound (up to sublogarithmic factors) for our approach, and also show that no line-separator of sublinear size in n exists when we look at disks of arbitrary radii, even when m=0. Proofs are constructive and suggest simple algorithms that run in linear time. Experimental evaluation has also been conducted, which shows that for random instances our method outperforms the method by Fox and Pach (whose separator has size O(m)).

AB - We prove a geometric version of the graph separator theorem for the unit disk intersection graph: for any set of n unit disks in the plane there exists a line ℓ such that ℓ intersects at most O((m+n)logn) disks and each of the halfplanes determined by ℓ contains at most 2n/3 unit disks from the set, where m is the number of intersecting pairs of disks. We also show that an axis-parallel line intersecting O(m+n) disks exists, but each halfplane may contain up to 4n/5 disks. We give an almost tight lower bound (up to sublogarithmic factors) for our approach, and also show that no line-separator of sublinear size in n exists when we look at disks of arbitrary radii, even when m=0. Proofs are constructive and suggest simple algorithms that run in linear time. Experimental evaluation has also been conducted, which shows that for random instances our method outperforms the method by Fox and Pach (whose separator has size O(m)).

KW - Balanced separator

KW - Centerpoint

KW - Geometric intersection graph

KW - Line separator

KW - Unit disk graph

UR - http://www.scopus.com/inward/record.url?scp=85072551207&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85072551207&partnerID=8YFLogxK

U2 - 10.1016/j.comgeo.2019.101575

DO - 10.1016/j.comgeo.2019.101575

M3 - Article

AN - SCOPUS:85072551207

VL - 86

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

SN - 0925-7721

M1 - 101575

ER -