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/

Zendy Plus

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

Zendy Tools

Zendy Open

We present an expected linear-time algorithm to construct thefarthest-segment Voronoi diagram, given the sequence of its faces at infinity.This sequence forms a Davenport-Schinzel sequence of order 3 and it can becomputed in O(n log n) time, where n is the number of input segments. Thefarthest-segment Voronoi diagram is a tree, with disconnected Voronoi regions,of total complexity Theta(n) in the worst case. Disconnected regions pose amajor difficulty in deriving linear-time construction algorithms for suchtree-like Voronoi diagrams. In this paper we present a new approach towardsthis direction.

An Expected Linear-Time Algorithm for the Farthest-Segment Voronoi Diagram