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 prove tight upper bounds for the number of vertices of a simple polygonthat is the union or the intersection of two simple polygons with given numbersof convex and concave vertices. The similar question on graphs of the lower (orupper) envelope of two continuous piecewise linear functions is considered.

On complexity of envelopes of piecewise linear functions, unions and intersections of polygons