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

In [1], we studied the problem of reconstructing a discrete set 5 from its horizontal and vertical projections. We defined an algorithm that establishes the existence of a convex polyomino Λ whose horizontal and vertical projections are equal to a pair of assigned vectors (H,V), with H ∈ ℕ m and V ∈ ℕ n . Its computational cost is O(n4m4). In this paper, we introduce some operations for recontructing convex polyominoes by means of vectors H's and V's partial sums. These operations allows us to define a new algorithm whose complexity is less than O(n2m2).

Reconstructing convex polyominoes from horizontal and vertical projections II