Discrete Sibson interpolation

Natural-neighbor interpolation methods, such as Sibson's method, are well-known schemes for multivariate data fitting and reconstruction. Despite its many desirable properties, Sibson's method is computationally expensive and difficult to implement, especially when applied to higher-dimens...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 12(2006), 2 vom: 06. März, Seite 243-53
1. Verfasser: Park, Sung W (VerfasserIn)
Weitere Verfasser: Linsen, Lars, Kreylos, Oliver, Owens, John D, Hamann, Bernd
Format: Aufsatz
Sprache:English
Veröffentlicht: 2006
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Evaluation Study Journal Article Research Support, N.I.H., Extramural Research Support, Non-U.S. Gov't Research Support, U.S. Gov't, Non-P.H.S.
LEADER 01000naa a22002652 4500
001 NLM161011454
003 DE-627
005 20231223091309.0
007 tu
008 231223s2006 xx ||||| 00| ||eng c
028 5 2 |a pubmed24n0537.xml 
035 |a (DE-627)NLM161011454 
035 |a (NLM)16509383 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Park, Sung W  |e verfasserin  |4 aut 
245 1 0 |a Discrete Sibson interpolation 
264 1 |c 2006 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 29.03.2006 
500 |a Date Revised 10.12.2019 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a Natural-neighbor interpolation methods, such as Sibson's method, are well-known schemes for multivariate data fitting and reconstruction. Despite its many desirable properties, Sibson's method is computationally expensive and difficult to implement, especially when applied to higher-dimensional data. The main reason for both problems is the method's implementation based on a Voronoi diagram of all data points. We describe a discrete approach to evaluating Sibson's interpolant on a regular grid, based solely on finding nearest neighbors and rendering and blending d-dimensional spheres. Our approach does not require us to construct an explicit Voronoi diagram, is easily implemented using commodity three-dimensional graphics hardware, leads to a significant speed increase compared to traditional approaches, and generalizes easily to higher dimensions. For large scattered data sets, we achieve two-dimensional (2D) interpolation at interactive rates and 3D interpolation (3D) with computation times of a few seconds 
650 4 |a Evaluation Study 
650 4 |a Journal Article 
650 4 |a Research Support, N.I.H., Extramural 
650 4 |a Research Support, Non-U.S. Gov't 
650 4 |a Research Support, U.S. Gov't, Non-P.H.S. 
700 1 |a Linsen, Lars  |e verfasserin  |4 aut 
700 1 |a Kreylos, Oliver  |e verfasserin  |4 aut 
700 1 |a Owens, John D  |e verfasserin  |4 aut 
700 1 |a Hamann, Bernd  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 12(2006), 2 vom: 06. März, Seite 243-53  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:12  |g year:2006  |g number:2  |g day:06  |g month:03  |g pages:243-53 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 12  |j 2006  |e 2  |b 06  |c 03  |h 243-53