Knowledge (XXG)

Natural-neighbor interpolation

Source 📝

509: 31: 1020: 1110: 745: 859:
Natural neighbor interpolation has also been implemented in a discrete form, which has been demonstrated to be computationally more efficient in at least some circumstances. A form of discrete natural neighbor interpolation has also been developed that gives a measure of interpolation uncertainty.
584: 457: 43:. The purple-shaded region is the new Voronoi cell, after inserting the point to be interpolated (black dot). The weights represent the intersection areas of the purple-cell with each of the seven surrounding cells. 944:
V.V. Belikov; V.D. Ivanov; V.K. Kontorovich; S.A. Korytnik; A.Y. Semenov (1997). "The non-Sibsonian interpolation: A new method of interpolation of the values of a function on an arbitrary set of points".
172: 838:
The method is entirely local, as it is based on a minimal subset of data locations that excludes locations that, while close, are more distant than another location in a similar direction.
287: 320: 347: 251: 204: 740:{\displaystyle w_{i}(\mathbf {x} )={\frac {\frac {l(\mathbf {x} _{i})}{d(\mathbf {x} _{i})}}{\sum _{k=1}^{n}{\frac {l(\mathbf {x} _{k})}{d(\mathbf {x} _{k})}}}}} 367: 224: 1151: 378: 1170: 1175: 1085: 1144: 67: 850:
The method is parameter free, so no input parameters that will affect the success of the interpolation need to be specified.
84: 508: 1137: 874: 869: 841:
The method is spatially adaptive, automatically adapting to local variation in data density or spatial arrangement.
34:
Natural neighbor interpolation with Sibson weights. The area of the green circles are the interpolating weights,
832:
The method is an exact interpolator, in that the original data values are retained at the reference data points.
894:
Sibson, R. (1981). "A brief description of natural neighbor interpolation (Chapter 2)". In V. Barnett (ed.).
30: 969:"Discrete natural neighbour interpolation with uncertainty using cross-validation error-distance fields" 765: 66:
of a discrete set of spatial points. This has advantages over simpler methods of interpolation, such as
55: 909:
N.H. Christ; R. Friedberg, R.; T.D. Lee (1982). "Weights of links and plaquettes in a random lattice".
918: 1117: 1080: 349:, are calculated by finding how much of each of the surrounding areas is "stolen" when inserting 1095: 17: 1059: 1008: 990: 256: 1121: 292: 1051: 998: 980: 926: 325: 229: 1024: 1019: 786: 180: 63: 1086:
Implementation notes for natural neighbor, and comparison to other interpolation methods
922: 1003: 968: 352: 209: 1164: 930: 59: 1109: 847:
The method can be applied to very small datasets as it is not statistically based.
452:{\displaystyle w_{i}(\mathbf {x} )={\frac {A(\mathbf {x} _{i})}{A(\mathbf {x} )}}} 70:, in that it provides a smoother approximation to the underlying "true" function. 1039: 994: 1091:
Interactive Voronoi diagram and natural neighbor interpolation visualization
1090: 1063: 1012: 1055: 985: 828:
There are several useful properties of natural neighbor interpolation:
1038:
Park, S.W.; Linsen, L.; Kreylos, O.; Owens, J.D.; Hamann, B. (2006).
512:
Natural neighbor interpolation with Laplace weights. The interface
488:
is the volume of the intersection between the new cell centered in
835:
The method creates a smooth surface free from any discontinuities.
507: 29: 1096:
Fast, discrete natural neighbor interpolation in 3D on the CPU
1023: This article incorporates text available under the 1044:
IEEE Transactions on Visualization and Computer Graphics
844:
There is no requirement to make statistical assumptions.
1125: 167:{\displaystyle G(x)=\sum _{i=1}^{n}{w_{i}(x)f(x_{i})}} 587: 381: 355: 328: 295: 259: 232: 212: 183: 87: 947:Computational Mathematics and Mathematical Physics 739: 451: 361: 341: 314: 281: 245: 218: 198: 166: 1145: 768:of the interface between the cells linked to 8: 1152: 1138: 468:is the volume of the new cell centered in 1002: 984: 898:. Chichester: John Wiley. pp. 21–36. 722: 717: 699: 694: 684: 678: 667: 651: 646: 628: 623: 612: 601: 592: 586: 438: 421: 416: 406: 395: 386: 380: 354: 333: 327: 303: 294: 270: 258: 237: 231: 211: 182: 154: 129: 124: 118: 107: 86: 886: 967:Etherington, Thomas R. (2020-07-13). 7: 1106: 1104: 962: 960: 1124:. You can help Knowledge (XXG) by 789:(length in 2D, surface in 3D) and 25: 1108: 1018: 718: 695: 647: 624: 602: 439: 417: 396: 1040:"Discrete Sibson interpolation" 543:is in blue, while the distance 27:Method of spatial interpolation 18:Natural neighbour interpolation 1081:Natural Neighbor Interpolation 896:Interpreting Multivariate Data 728: 713: 705: 690: 657: 642: 634: 619: 606: 598: 443: 435: 427: 412: 400: 392: 309: 296: 276: 263: 193: 187: 160: 147: 141: 135: 97: 91: 68:nearest-neighbor interpolation 48:Natural-neighbor interpolation 1: 494:and the old cell centered in 931:10.1016/0550-3213(82)90124-9 526:between the cells linked to 1192: 1171:Multivariate interpolation 1103: 875:Multivariate interpolation 870:Inverse distance weighting 1176:Applied mathematics stubs 62:. The method is based on 282:{\displaystyle f(x_{i})} 803:, the distance between 369:into the tessellation. 315:{\displaystyle (x_{i})} 78:The basic equation is: 1120:-related article is a 973:PeerJ Computer Science 741: 683: 575: 453: 363: 343: 316: 289:are the known data at 283: 247: 220: 200: 168: 123: 44: 742: 663: 511: 454: 364: 344: 342:{\displaystyle w_{i}} 317: 284: 248: 246:{\displaystyle w_{i}} 221: 201: 169: 103: 56:spatial interpolation 33: 1056:10.1109/TVCG.2006.27 986:10.7717/peerj-cs.282 585: 379: 353: 326: 293: 257: 253:are the weights and 230: 210: 199:{\displaystyle G(x)} 181: 85: 64:Voronoi tessellation 52:Sibson interpolation 1118:applied mathematics 923:1982NuPhB.210..337C 206:is the estimate at 737: 576: 449: 359: 339: 312: 279: 243: 216: 196: 164: 45: 1133: 1132: 911:Nuclear Physics B 735: 732: 661: 447: 362:{\displaystyle x} 219:{\displaystyle x} 16:(Redirected from 1183: 1154: 1147: 1140: 1112: 1105: 1068: 1067: 1035: 1029: 1022: 1016: 1006: 988: 964: 955: 954: 941: 935: 934: 906: 900: 899: 891: 819: 808: 802: 784: 773: 763: 746: 744: 743: 738: 736: 734: 733: 731: 727: 726: 721: 708: 704: 703: 698: 685: 682: 677: 660: 656: 655: 650: 637: 633: 632: 627: 614: 613: 605: 597: 596: 573: 562: 556: 542: 531: 525: 504: 493: 487: 473: 467: 458: 456: 455: 450: 448: 446: 442: 430: 426: 425: 420: 407: 399: 391: 390: 368: 366: 365: 360: 348: 346: 345: 340: 338: 337: 321: 319: 318: 313: 308: 307: 288: 286: 285: 280: 275: 274: 252: 250: 249: 244: 242: 241: 225: 223: 222: 217: 205: 203: 202: 197: 173: 171: 170: 165: 163: 159: 158: 134: 133: 122: 117: 21: 1191: 1190: 1186: 1185: 1184: 1182: 1181: 1180: 1161: 1160: 1159: 1158: 1101: 1077: 1072: 1071: 1037: 1036: 1032: 966: 965: 958: 943: 942: 938: 908: 907: 903: 893: 892: 888: 883: 866: 857: 826: 818: 810: 804: 798: 790: 787:Voronoi diagram 783: 775: 769: 759: 751: 716: 709: 693: 686: 662: 645: 638: 622: 615: 588: 583: 582: 579:Laplace weights 572: 564: 558: 552: 544: 541: 533: 527: 521: 513: 503: 495: 489: 483: 475: 469: 463: 431: 415: 408: 382: 377: 376: 351: 350: 329: 324: 323: 322:. The weights, 299: 291: 290: 266: 255: 254: 233: 228: 227: 208: 207: 179: 178: 150: 125: 83: 82: 76: 58:, developed by 54:is a method of 42: 28: 23: 22: 15: 12: 11: 5: 1189: 1187: 1179: 1178: 1173: 1163: 1162: 1157: 1156: 1149: 1142: 1134: 1131: 1130: 1113: 1099: 1098: 1093: 1088: 1083: 1076: 1075:External links 1073: 1070: 1069: 1050:(2): 243–253. 1030: 956: 936: 917:(3): 337–346. 901: 885: 884: 882: 879: 878: 877: 872: 865: 862: 856: 853: 852: 851: 848: 845: 842: 839: 836: 833: 825: 822: 814: 794: 779: 755: 748: 747: 730: 725: 720: 715: 712: 707: 702: 697: 692: 689: 681: 676: 673: 670: 666: 659: 654: 649: 644: 641: 636: 631: 626: 621: 618: 611: 608: 604: 600: 595: 591: 580: 568: 548: 537: 517: 499: 479: 460: 459: 445: 441: 437: 434: 429: 424: 419: 414: 411: 405: 402: 398: 394: 389: 385: 374: 373:Sibson weights 358: 336: 332: 311: 306: 302: 298: 278: 273: 269: 265: 262: 240: 236: 215: 195: 192: 189: 186: 175: 174: 162: 157: 153: 149: 146: 143: 140: 137: 132: 128: 121: 116: 113: 110: 106: 102: 99: 96: 93: 90: 75: 72: 38: 26: 24: 14: 13: 10: 9: 6: 4: 3: 2: 1188: 1177: 1174: 1172: 1169: 1168: 1166: 1155: 1150: 1148: 1143: 1141: 1136: 1135: 1129: 1127: 1123: 1119: 1114: 1111: 1107: 1102: 1097: 1094: 1092: 1089: 1087: 1084: 1082: 1079: 1078: 1074: 1065: 1061: 1057: 1053: 1049: 1045: 1041: 1034: 1031: 1028: 1026: 1021: 1014: 1010: 1005: 1000: 996: 992: 987: 982: 978: 974: 970: 963: 961: 957: 952: 948: 940: 937: 932: 928: 924: 920: 916: 912: 905: 902: 897: 890: 887: 880: 876: 873: 871: 868: 867: 863: 861: 854: 849: 846: 843: 840: 837: 834: 831: 830: 829: 823: 821: 817: 813: 807: 801: 797: 793: 788: 782: 778: 772: 767: 762: 758: 754: 723: 710: 700: 687: 679: 674: 671: 668: 664: 652: 639: 629: 616: 609: 593: 589: 581: 578: 577: 571: 567: 561: 555: 551: 547: 540: 536: 530: 524: 520: 516: 510: 506: 502: 498: 492: 486: 482: 478: 472: 466: 432: 422: 409: 403: 387: 383: 375: 372: 371: 370: 356: 334: 330: 304: 300: 271: 267: 260: 238: 234: 213: 190: 184: 155: 151: 144: 138: 130: 126: 119: 114: 111: 108: 104: 100: 94: 88: 81: 80: 79: 73: 71: 69: 65: 61: 57: 53: 49: 41: 37: 32: 19: 1126:expanding it 1115: 1100: 1047: 1043: 1033: 1017: 976: 972: 950: 946: 939: 914: 910: 904: 895: 889: 858: 827: 815: 811: 805: 799: 795: 791: 780: 776: 770: 760: 756: 752: 749: 569: 565: 559: 553: 549: 545: 538: 534: 528: 522: 518: 514: 500: 496: 490: 484: 480: 476: 470: 464: 461: 176: 77: 60:Robin Sibson 51: 47: 46: 39: 35: 74:Formulation 1165:Categories 953:(1): 9–15. 881:References 855:Extensions 824:Properties 574:is in red. 1025:CC BY 4.0 995:2376-5992 665:∑ 105:∑ 1064:16509383 1027:license. 1013:33816933 979:: e282. 864:See also 557:between 1004:7924714 919:Bibcode 785:in the 766:measure 764:is the 1062:  1011:  1001:  993:  750:where 474:, and 462:where 177:where 1116:This 1122:stub 1060:PMID 1009:PMID 991:ISSN 809:and 774:and 563:and 532:and 465:A(x) 1052:doi 999:PMC 981:doi 927:doi 915:210 792:d(x 753:l(x 546:d(x 515:l(x 477:A(x 50:or 1167:: 1058:. 1048:12 1046:. 1042:. 1007:. 997:. 989:. 975:. 971:. 959:^ 951:37 949:. 925:. 913:. 820:. 505:. 226:, 1153:e 1146:t 1139:v 1128:. 1066:. 1054:: 1015:. 983:: 977:6 933:. 929:: 921:: 816:i 812:x 806:x 800:) 796:i 781:i 777:x 771:x 761:) 757:i 729:) 724:k 719:x 714:( 711:d 706:) 701:k 696:x 691:( 688:l 680:n 675:1 672:= 669:k 658:) 653:i 648:x 643:( 640:d 635:) 630:i 625:x 620:( 617:l 610:= 607:) 603:x 599:( 594:i 590:w 570:i 566:x 560:x 554:) 550:i 539:i 535:x 529:x 523:) 519:i 501:i 497:x 491:x 485:) 481:i 471:x 444:) 440:x 436:( 433:A 428:) 423:i 418:x 413:( 410:A 404:= 401:) 397:x 393:( 388:i 384:w 357:x 335:i 331:w 310:) 305:i 301:x 297:( 277:) 272:i 268:x 264:( 261:f 239:i 235:w 214:x 194:) 191:x 188:( 185:G 161:) 156:i 152:x 148:( 145:f 142:) 139:x 136:( 131:i 127:w 120:n 115:1 112:= 109:i 101:= 98:) 95:x 92:( 89:G 40:i 36:w 20:)

Index

Natural neighbour interpolation

spatial interpolation
Robin Sibson
Voronoi tessellation
nearest-neighbor interpolation

measure
Voronoi diagram
Inverse distance weighting
Multivariate interpolation
Bibcode
1982NuPhB.210..337C
doi
10.1016/0550-3213(82)90124-9


"Discrete natural neighbour interpolation with uncertainty using cross-validation error-distance fields"
doi
10.7717/peerj-cs.282
ISSN
2376-5992
PMC
7924714
PMID
33816933

CC BY 4.0
"Discrete Sibson interpolation"
doi

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.