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

In this paper, we present our heuristic solutions to the problems of findingthe maximum and minimum area polygons with a given set of vertices. Oursolutions are based mostly on two simple algorithmic paradigms: greedy methodand local search. The greedy heuristic starts with a simple polygon and addsvertices one by one, according to a weight function. A crucial ingredient toobtain good solutions is the choice of an appropriate weight function thatavoids long edges. The local search part consists of moving consecutivevertices to another location in the polygonal chain. We also discuss thedifferent implementation techniques that are necessary to reduce the runningtime.

Greedy and Local Search Heuristics to Build Area-Optimal Polygons