Result: Smooth natural neighbour interpolants over the whole domain

Title:
Smooth natural neighbour interpolants over the whole domain
Source:
Computational methods in computer graphics and scientific visualisationInternational journal of computational science and engineering (Print). 3(1):3-13
Publisher Information:
Genève: Inderscience, 2007.
Publication Year:
2007
Physical Description:
print, 1/4 p
Original Material:
INIST-CNRS
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, Faculty of Engineering, Gunma University, Kiryu, Japan
Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan
ISSN:
1742-7185
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19083918
Database:
PASCAL Archive

Further Information

The natural neighbour interpolation is a potential interpolation method for multidimensional data. However, only globally C' interpolants have been known so far. In this paper we propose a globally C2 interpolant, and write it in an explicit form. When the data are supplied to the interpolant from a third-degree polynomial, the interpolant can reproduce that polynomial exactly. The idea used to derive the interpolant is applicable to obtain a globally Cq interpolant for an arbitrary non-negative integer q. Hence, this paper gets rid of the continuity limitation of the natural neighbour interpolation, and thus leads it to a new research stage.