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

This paper introduces a new data structure useful to represent objects or data sets with several order relations between their elements. A specific case is the polygons that will be analyzed in this paper. Polygons are objects often used in Computer Graphics and their operations have a high computational cost; this data structure was implemented in Java language with a performance O(n*log(n)) corresponding to building and O(log(n)) to searching. The complexity analysis for insertion and searching routines are explained.

A data structure to represent data sets with more than one order relation like polygons