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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

.    We show that any orthogonal polygon of n vertices can be covered with at most  ``diagonal rectangles'' where ω=1 (n=8,12,16) and ω=0 (otherwise). An orthogonal polygon is a polygon whose edges are horizontal or vertical. A diagonal rectangle (of an orthogonal polygon) is a rectangle whose opposite corners are vertices of the orthogonal polygon. The result is sharp and settles a question of Mamoru Watanabe [11].

How Many Diagonal Rectangles Are Needed to Cover an Orthogonal Polygon?