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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $p$ and $q$ be two imprecise points, given as probability densityfunctions on $\mathbb R^2$, and let $\cal R$ be a set of $n$ line segments(obstacles) in $\mathbb R^2$. We study the problem of approximating theprobability that $p$ and $q$ can see each other; that is, that the segmentconnecting $p$ and $q$ does not cross any segment of $\cal R$. To solve thisproblem, we approximate each density function by a weighted set of polygons; anovel approach to dealing with probability density functions in computationalgeometry.

Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)