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

For a given real triangle T its discretization on a discrete point set S consists of points from S which fall into T. If the number of such points is finite, the obtained discretization of T will be called discrete triangle.In this paper we show that the discrete moments having the order up to 3 characterize uniquely the corresponding discrete triangle if the discretizationing set S is fixed.Of a particular interest is the case when S is the integer grid, i.e., S = Z2. Then the discretization of a triangle T is called digital triangle. It turns out that the proposed characterization preserves a coding of digital triangles from an integer grid of a given size, say m × m within an O(log m) amount of memory space per coded digital triangle. That is the theoretical minimum.

On Characterization of Discrete Triangles by Discrete Moments