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

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Region filling is one of the most important and fundamental operations incomputer graphics and image processing. Many filling algorithms and theirimplementations are based on the Euclidean geometry, which are then translatedinto computational models moving carelessly from the continuous to the finitediscrete space of the computer. The consequences of this approach is that mostimplementations fail when tested for challenging degenerate and nearlydegenerate regions. We present a correct integer-only procedure that works forall connected digital pictures. It finds all possible interior points, whichare then displayed and stored in a locating matrix. Namely, we present afilling and locating procedure that can be used in computer graphics and imageprocessing applications.

A programme to determine the exact interior of any connected digital picture