Let D be a set of n disks in the plane. The disk graph G_D for D is the undirected graph with vertex set D in which two disks are joined by an edge if and only if they intersect. The directed transmission graph G^{\rightarrow}_D for D is the directed graph with vertex set D in which there is an edge from a disk D_1 \in D to a disk D_2 \in D if and only if D_1 contains the center of D_2. Given D and two non-intersecting disks s, t \in D, we show that a minimum s-t vertex cut in G_D or in G^{\rightarrow}_\mathcal{D} can be found in O(n^{3/2} %DIFDELCMD < \operatorname{polylog} %%%  n) expected time. To obtain our result, we combine an algorithm for the maximum flow problem in general graphs with dynamic geometric data structures to manipulate the disks. As an application, we consider the \emph{barrier resilience problem in a rectangular domain. In this problem, we have a vertical strip S bounded by two vertical lines, L_\ell and L_r, and a collection \mathcal{D} of disks. Let a be a point in S above all disks of \mathcal{D}, and let b a point in S below all disks of \mathcal{D}. The task is to find a curve from a to b that lies in S and that intersects as few disks of \mathcal{D} as possible. Using our improved algorithm for minimum cuts in disk graphs, we can solve the barrier resilience problem in O(n^{3/2} %DIFDELCMD < \operatorname{polylog} %%%  n) expected time.
Let D be a set of n disks in the plane. The disk graph G_D for D is the undirected graph with vertex set D in which two disks are joined by an edge if and only if they intersect. The directed transmission graph G^{\rightarrow}_D for D is the directed graph with vertex set D in which there is an edge from a disk D_1 \in D to a disk D_2 \in D if and only if D_1 contains the center of D_2. Given D and two non-intersecting disks s, t \in D, we show that a minimum s-t vertex cut in G_D or in G^{\rightarrow}_\mathcal{D} can be found in O(n^{3/2} %DIFDELCMD < \operatorname{polylog} %%% \text{polylog n) expected time. To obtain our result, we combine an algorithm for the maximum flow problem in general graphs with dynamic geometric data structures to manipulate the disks. As an application, we consider the \emph{barrier resilience problem in a rectangular domain. In this problem, we have a vertical strip S bounded by two vertical lines, L_\ell and L_r, and a collection \mathcal{D} of disks. Let a be a point in S above all disks of \mathcal{D}, and let b a point in S below all disks of \mathcal{D}. The task is to find a curve from a to b that lies in S and that intersects as few disks of \mathcal{D} as possible. Using our improved algorithm for minimum cuts in disk graphs, we can solve the barrier resilience problem in O(n^{3/2} %DIFDELCMD < \operatorname{polylog} %%% \text{polylog n) expected time.
R
disk graph
disk graph
R
directed transmission graph
directed transmission graph
A
\text{polylog
R
barrier resilience problem
barrier resilience problem
A
\text{polylog