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 give an algorithm to compute a morph between any two convex drawings ofthe same plane graph. The morph preserves the convexity of the drawing at anytime instant and moves each vertex along a piecewise linear curve with linearcomplexity. The linear bound is asymptotically optimal in the worst case.

Optimal Morphs of Convex Drawings