English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Let $S \subseteq \mathbb{R}^2$ be a set of $n$ \emph{sites} in the plane, sothat every site $s \in S$ has an \emph{associated radius} $r_s > 0$. Let $D(S)$be the \emph{disk intersection graph} defined by $S$, i.e., the graph withvertex set $S$ and an edge between two distinct sites $s, t \in S$ if and onlyif the disks with centers $s$, $t$ and radii $r_s$, $r_t$ intersect. Our goalis to design data structures that maintain the connectivity structure of $D(S)$as $S$ changes dynamically over time. We consider the incremental case, wherenew sites can be inserted into $S$. While previous work focuses on datastructures whose running time depends on the ratio between the smallest and thelargest site in $S$, we present a data structure with $O(\alpha(n))$ amortizedquery time and $O(\log^6 n)$ expected amortized insertion time.

Insertion-Only Dynamic Connectivity in General Disk Graphs