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 present linear-time algorithms for both maximum hidden set and minimumconvex cover in funnel polygons. These algorithms show that funnel polygons are"homestead" polygons, i.e. polygons for which the hidden set number and theconvex cover number coincide. We extend the algorithm to apply to maximumhidden vertex set and use the result to give a 2-approximation for all threeproblems in pseudotriangles.

Convex Cover and Hidden Set in Funnel Polygons