Let ▫$\mathcal{D}$▫ be a set of ▫$n$▫ disks in the plane. The disk graph ▫$G_\mathcal{D}$▫ for ▫$\mathcal{D}$▫ is the undirected graph with vertex set ▫$\mathcal{D}$▫ in which two disks are joined by ...an edge if and only if they intersect. The directed transmission graph ▫$G^{\rightarrow}_\mathcal{D}$▫ for ▫$\mathcal{D}$▫ is the directed graph with vertex set ▫$\mathcal{D}$▫ in which there is an edge from a disk ▫$D_1 \in \mathcal{D}$▫ to a disk ▫$D_2 \in \mathcal{D}$▫ if and only if ▫$D_1$▫ contains the center of ▫$D_2$▫. Given ▫$\mathcal{D}$▫ and two non-intersecting disks ▫$s, t \in \mathcal{D}$▫, we show that a minimum ▫$s$▫-▫$t$▫ vertex cut in ▫$G_\mathcal{D}$▫ or in ▫$G^{\rightarrow}_\mathcal{D}$▫ can be found in ▫$O(n^{3/2}\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 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}\text{polylog} n)$▫ expected time.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
