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

In [3], algorithms to compute the density of the distance to a randomvariable uniformly distributed in (a) a ball, (b) a disk, (c) a line segment,or (d) a polygone were introduced. For case (d), the algorithm, based onGreen's theorem, has complexity nlog(n) where n is the number of vertices ofthe polygone. In this paper, we present for case (d) another algorithm with thesame complexity, based on a triangulation of the polygone. We also describe anopen source library providing this algorithm as well as the algorithms from[3].  [3] V. Guigues, Computation of the cumulative distribution function of theEuclidean distance between a point and a random variable uniformly distributedin disks, balls, or polyhedrons and application to Probabilistic Seismic HazardAnalysis, arXiv, available at arXiv:1809.02007, 2015.

A library to compute the density of the distance between a point and a random variable uniformly distributed in some sets