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

We show that the Hausdorff distance for two sets of non-intersecting linesegments can be computed in parallel in $O(\log^2 n)$ time using O(n)processors in a CREW-PRAM computation model. We discuss how some parts of thesequential algorithm can be performed in parallel using previously knownparallel algorithms; and identify the so-far unsolved part of the problem forthe parallel computation, which is the following: Given two sets of$x$-monotone curve segments, red and blue, for each red segment find itsextremal intersection points with the blue set, i.e. points with the minimaland maximal $x$-coordinate. Each segment set is assumed to be intersectionfree. For this intersection problem we describe a parallel algorithm whichcompletes the Hausdorff distance computation within the stated time andprocessor bounds.

Computation of the Hausdorff distance between sets of line segments in parallel