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

Let $$P$$P and $$Q$$Q be two simple polygons in the plane of total complexity n, each of which can be decomposed into at most k convex parts. We present a $$(1-\varepsilon )$$(1-ε)-approximation algorithm, for finding the translation of $$Q$$Q, which maximizes its area of overlap with $$P$$P. Our algorithm runs in $$O\left( {c n}\right) $$Ocn time, where c is a constant that depends only on k and $$\varepsilon $$ε. This suggests that for polygons that are “close” to being convex, the problem can be solved (approximately), in near linear time.

Approximating the Maximum Overlap of Polygons under Translation