Mercè Claverol , Andrea de las Heras-Parrilla , Clemens Huemer , Dolores Lara
{"title":"Sibson高阶Voronoi图的公式","authors":"Mercè Claverol , Andrea de las Heras-Parrilla , Clemens Huemer , Dolores Lara","doi":"10.1016/j.cagd.2025.102470","DOIUrl":null,"url":null,"abstract":"<div><div>Let <em>S</em> be a set of <em>n</em> points in general position in <span><math><msup><mrow><mi>R</mi></mrow><mrow><mi>d</mi></mrow></msup></math></span>. The order-<em>k</em> Voronoi diagram of <em>S</em>, <span><math><msub><mrow><mi>V</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo></math></span>, is a subdivision of <span><math><msup><mrow><mi>R</mi></mrow><mrow><mi>d</mi></mrow></msup></math></span> into cells whose points have the same <em>k</em> nearest points of <em>S</em>. Sibson, in his seminal paper from 1980 (A vector identity for the Dirichlet tessellation), gives a formula to express a point <em>Q</em> of <em>S</em> as a convex combination of other points of <em>S</em> using ratios of volumes of the intersection of cells of <span><math><msub><mrow><mi>V</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo></math></span> and the cell of <em>Q</em> in <span><math><msub><mrow><mi>V</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo></math></span>. The natural neighbour interpolation method is based on Sibson's formula. We generalize his result to express <em>Q</em> as a convex combination of other points of <em>S</em> by using ratios of volumes from Voronoi diagrams of any given order.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"121 ","pages":"Article 102470"},"PeriodicalIF":1.7000,"publicationDate":"2025-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sibson's formula for higher order Voronoi diagrams\",\"authors\":\"Mercè Claverol , Andrea de las Heras-Parrilla , Clemens Huemer , Dolores Lara\",\"doi\":\"10.1016/j.cagd.2025.102470\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Let <em>S</em> be a set of <em>n</em> points in general position in <span><math><msup><mrow><mi>R</mi></mrow><mrow><mi>d</mi></mrow></msup></math></span>. The order-<em>k</em> Voronoi diagram of <em>S</em>, <span><math><msub><mrow><mi>V</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo></math></span>, is a subdivision of <span><math><msup><mrow><mi>R</mi></mrow><mrow><mi>d</mi></mrow></msup></math></span> into cells whose points have the same <em>k</em> nearest points of <em>S</em>. Sibson, in his seminal paper from 1980 (A vector identity for the Dirichlet tessellation), gives a formula to express a point <em>Q</em> of <em>S</em> as a convex combination of other points of <em>S</em> using ratios of volumes of the intersection of cells of <span><math><msub><mrow><mi>V</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo></math></span> and the cell of <em>Q</em> in <span><math><msub><mrow><mi>V</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo></math></span>. The natural neighbour interpolation method is based on Sibson's formula. We generalize his result to express <em>Q</em> as a convex combination of other points of <em>S</em> by using ratios of volumes from Voronoi diagrams of any given order.</div></div>\",\"PeriodicalId\":55226,\"journal\":{\"name\":\"Computer Aided Geometric Design\",\"volume\":\"121 \",\"pages\":\"Article 102470\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2025-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Aided Geometric Design\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167839625000597\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Aided Geometric Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167839625000597","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
Sibson's formula for higher order Voronoi diagrams
Let S be a set of n points in general position in . The order-k Voronoi diagram of S, , is a subdivision of into cells whose points have the same k nearest points of S. Sibson, in his seminal paper from 1980 (A vector identity for the Dirichlet tessellation), gives a formula to express a point Q of S as a convex combination of other points of S using ratios of volumes of the intersection of cells of and the cell of Q in . The natural neighbour interpolation method is based on Sibson's formula. We generalize his result to express Q as a convex combination of other points of S by using ratios of volumes from Voronoi diagrams of any given order.
期刊介绍:
The journal Computer Aided Geometric Design is for researchers, scholars, and software developers dealing with mathematical and computational methods for the description of geometric objects as they arise in areas ranging from CAD/CAM to robotics and scientific visualization. The journal publishes original research papers, survey papers and with quick editorial decisions short communications of at most 3 pages. The primary objects of interest are curves, surfaces, and volumes such as splines (NURBS), meshes, subdivision surfaces as well as algorithms to generate, analyze, and manipulate them. This journal will report on new developments in CAGD and its applications, including but not restricted to the following:
-Mathematical and Geometric Foundations-
Curve, Surface, and Volume generation-
CAGD applications in Numerical Analysis, Computational Geometry, Computer Graphics, or Computer Vision-
Industrial, medical, and scientific applications.
The aim is to collect and disseminate information on computer aided design in one journal. To provide the user community with methods and algorithms for representing curves and surfaces. To illustrate computer aided geometric design by means of interesting applications. To combine curve and surface methods with computer graphics. To explain scientific phenomena by means of computer graphics. To concentrate on the interaction between theory and application. To expose unsolved problems of the practice. To develop new methods in computer aided geometry.