沃罗诺伊路径和景观的平均失真和预期失真

IF 0.6 3区数学 Q4 COMPUTER SCIENCE, THEORY & METHODS Discrete & Computational Geometry Pub Date : 2024-06-04 DOI:10.1007/s00454-024-00660-y

Herbert Edelsbrunner, Anton Nikitenko

{"title":"沃罗诺伊路径和景观的平均失真和预期失真","authors":"Herbert Edelsbrunner, Anton Nikitenko","doi":"10.1007/s00454-024-00660-y","DOIUrl":null,"url":null,"abstract":"The approximation of a circle with the edges of a fine square grid distorts the perimeter by a factor about \\(\\tfrac{4}{\\pi }\\). We prove that this factor is the same on average (in the ergodic sense) for approximations of any rectifiable curve by the edges of any non-exotic Delaunay mosaic (known as Voronoi path), and extend the results to all dimensions, generalizing Voronoi paths to Voronoi scapes.","PeriodicalId":50574,"journal":{"name":"Discrete & Computational Geometry","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Average and Expected Distortion of Voronoi Paths and Scapes\",\"authors\":\"Herbert Edelsbrunner, Anton Nikitenko\",\"doi\":\"10.1007/s00454-024-00660-y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The approximation of a circle with the edges of a fine square grid distorts the perimeter by a factor about \\\\(\\\\tfrac{4}{\\\\pi }\\\\). We prove that this factor is the same on average (in the ergodic sense) for approximations of any rectifiable curve by the edges of any non-exotic Delaunay mosaic (known as Voronoi path), and extend the results to all dimensions, generalizing Voronoi paths to Voronoi scapes.\",\"PeriodicalId\":50574,\"journal\":{\"name\":\"Discrete & Computational Geometry\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete & Computational Geometry\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s00454-024-00660-y\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete & Computational Geometry","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00454-024-00660-y","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

用精细正方形网格的边缘近似一个圆时，其周长的扭曲系数约为\(\tfrac{4}{pi }\) 。我们证明，对于用任何非奇异的 Delaunay 马赛克（被称为 Voronoi 路径）的边缘逼近任何可整型曲线，这个因子的平均值是相同的（在遍历意义上），并将结果扩展到所有维度，将 Voronoi 路径推广到 Voronoi Scapes。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

摘要图片

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Average and Expected Distortion of Voronoi Paths and Scapes

The approximation of a circle with the edges of a fine square grid distorts the perimeter by a factor about \(\tfrac{4}{\pi }\). We prove that this factor is the same on average (in the ergodic sense) for approximations of any rectifiable curve by the edges of any non-exotic Delaunay mosaic (known as Voronoi path), and extend the results to all dimensions, generalizing Voronoi paths to Voronoi scapes.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete & Computational Geometry 数学-计算机：理论方法

CiteScore

1.80

自引率

12.50%

发文量

审稿时长

6-12 weeks

期刊介绍： Discrete & Computational Geometry (DCG) is an international journal of mathematics and computer science, covering a broad range of topics in which geometry plays a fundamental role. It publishes papers on such topics as configurations and arrangements, spatial subdivision, packing, covering, and tiling, geometric complexity, polytopes, point location, geometric probability, geometric range searching, combinatorial and computational topology, probabilistic techniques in computational geometry, geometric graphs, geometry of numbers, and motion planning.

期刊最新文献

The Complexity of Order Type Isomorphism Volume Computation for Meissner Polyhedra and Applications Erdős–Szekeres-Type Problems in the Real Projective Plane The Structure of Metrizable Graphs Estimating the Convex Hull of the Image of a Set with Smooth Boundary: Error Bounds and Applications