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 this paper we investigate an approach of constructing a digital curve by taking the integer points within an offset of a certain radius of a continuous curve. Our considerations apply to digitizations of arbitrary curves in arbitrary dimension n. As main theoretical results, we first show that if the offset radius is greater than or equal to √n/2,then the obtained digital curve features maximal connectivity. We also demonstrate that the radius value √n/2 is the minimal possible that always guarantees such a connectivity. Moreover, we prove that a radius length greater than or equal to √n - 1/2 guarantees 0-connectivity, and that this is the minimal possible value with this property. Thus, we answer the question about the minimal offset size that guarantees maximal or minimal connectivity of an offset digital curve.

Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD