{"title":"基于阿基米德对偶原理的平面曲线的离散曲率","authors":"V. Garanzha, L. Kudryavtseva, Dmitry A. Makarov","doi":"10.1515/rnam-2022-0007","DOIUrl":null,"url":null,"abstract":"Abstract 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.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Discrete curvatures for planar curves based on Archimedes’ duality principle\",\"authors\":\"V. Garanzha, L. Kudryavtseva, Dmitry A. Makarov\",\"doi\":\"10.1515/rnam-2022-0007\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract 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.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2022-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1515/rnam-2022-0007\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1515/rnam-2022-0007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Discrete curvatures for planar curves based on Archimedes’ duality principle
Abstract 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.