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

We introduce discrete curvatures for planar curves based on the construction of sequences of pairs of mutually dual polylines. For piecewise-regular curves consisting of a finite number of fragments of regular generalized spirals with definite (positive or negative) curvatures our discrete curvatures approximate the exact averaged curvature from below and from above. In order to derive these estimates one should provide a distance function allowing to compute the closest point on the curve for an arbitrary point on the plane.With refinement of the polylines, the averaged curvature over refined curve segments converges to the pointwise values of the curvature and, thus, we obtain a good and stable local approximation of the curvature. For the important engineering case when the curve is approximated only by the inscribed (primal) polyline and the exact distance function is not available, we provide a comparative analysis for several techniques allowing to build dual polylines and discrete curvatures and evaluate their ability to create lower and upper estimates for the averaged curvature.

Discrete curvatures for planar curves based on Archimedes’ duality principle