Some questions about interpolation...
Aupetit Mickael
Michael.Aupetit at site-eerie.ema.fr
Thu Jul 1 13:10:24 PDT 1999
Hello,
my name is Michael Aupetit, I'm a PhD student in the field
of Artificial Neural Networks. I'm very interested by interpolation
technics.
I've heard about "natural Neighbours"; "NURBS" and some
other technics, but I fear these technics are not able to deal with
high dimensional input spaces (as we found in ANNs) with reasonable
time consuming and complexity of operations (e.g. for example,how
to calculate vector product used in Natural Neighbour Interpolation,
while the dimension of vectors is higher than 3?).
So, I have three questions:
Hypothesis:
I have the p-dimensional Delaunay triangulation of n data
points. And I know the Jacobian (gradient) and possibly the Hessian
(curvature) in each data point.
1) Does it exist any interpolation method able to deal with high
dimension (at least more than 5) that is C1 or C2 where ever?
Could you send me references?
2) What is the complexity of existing interpolation technics according
to n (the number of data points that support the interpolation) and p
(the dimension of the input space) or other parameters?
3) Does it exist "standard" tests to establish that an interpolation
method is "good" or "bad"? (e.g. for example, we could imagine an
interpolation method able to pass through all data points with a 1st
order continuity where ever, but with a not desired behavior between
data points, as "holly" or "gap" between them even if they are
theoretically in the same plan according to their respective Jacobian...)
Thank you for your help
Sorry if I've already contacted you by another way.
Michael Aupetit
______________________________________
| Michael AUPETIT |
| LGI2P - EMA - Site EERIE |
| Parc Scientifique G.BESSE |
| 30000 Nimes |
| FRANCE |
| |
| Ph.D (1st year) student |
| Department of Neural Network |
| and Self-organization |
| |
| Phone: (033) 04.66.04.16.84 |
| Fax: (033) 04.66.38.70.74 |
| E-mail: aupetit at site-eerie.ema.fr |
|______________________________________|
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html.
More information about the Compgeom-announce
mailing list