default search action
Christophe Rabut
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j14]Mira Bozzini, Christophe Rabut, Milvia Rossini:
Decomposition and reconstruction of multidimensional signals by radial functions with tension parameters. Adv. Comput. Math. 44(4): 1003-1040 (2018) - 2014
- [c3]Brunilde Girardet, Laurent Lapasset, Daniel Delahaye, Christophe Rabut:
Wind-optimal path planning: Application to aircraft trajectories. ICARCV 2014: 1403-1408 - 2011
- [c2]Daniel Delahaye, Christophe Rabut
, Stéphane Puechmorel:
Wind field evaluation by using radar data and vector spline interpolation. ICCA 2011: 219-224
2000 – 2009
- 2008
- [j13]Costanza Conti
Locally tensor product functions in algebraic grid optimization. Appl. Math. Comput. 197(2): 745-754 (2008) - [j12]Carl de Boor, Christian Gout
Multivariate approximation: theory and applications. An overview. Numer. Algorithms 48(1-3): 1-9 (2008) - [j11]Christophe Rabut
Polyharmonic multiresolution analysis: an overview and some new results. Numer. Algorithms 48(1-3): 135-160 (2008) - 2005
- [j10]Dominique Apprato, Christian Gout
Multivariate approximation: An overview. Numer. Algorithms 39(1-3): 1-6 (2005) - [j9]Christophe Rabut
Locally tensor product functions. Numer. Algorithms 39(1-3): 329-348 (2005) - 2004
- [j8]Fabrice Dodu, Christophe Rabut
Irrotational or divergence-free interpolation. Numerische Mathematik 98(3): 477-498 (2004) - 2002
- [j7]Christophe Rabut
On Pierre Bézier's life and motivations. Comput. Aided Des. 34(7): 493-510 (2002) - 2001
- [j6]Costanza Conti
Cubic Spline Data Reduction Choosing the Knots from a Third Derivative Criterion. Numer. Algorithms 28(1-4): 45-61 (2001) - 2000
- [j5]Christophe Rabut
Multivariate Divided Differences with Simple Knots. SIAM J. Numer. Anal. 38(4): 1294-1311 (2000)
1990 – 1999
- 1992
- [j4]Christophe Rabut
Even degree B-spline curves and surfaces : A note on the paper "B-spline Curves and Surfaces Viewed as Digital Filters" by A. Goshtasby, F. Cheng, and B. Barsky. CVGIP Graph. Model. Image Process. 54(4): 351-356 (1992) - [j3]Christophe Rabut
Elementarym-harmonic cardinal B-splines. Numer. Algorithms 2(1): 39-61 (1992) - [j2]Christophe Rabut
High levelm-harmonic cardinal B-splines. Numer. Algorithms 2(1): 63-84 (1992) - 1991
- [j1]Charles A. Micchelli, Christophe Rabut
Using the refinement equation for the construction of pre-wavelets III: Elliptic splines. Numer. Algorithms 1(3): 331-351 (1991) - [p1]Christophe Rabut:
How to Build Quasi-Interpolants: Application to Polyharmonic B-Splines. Curves and Surfaces 1991: 391-402
1980 – 1989
- 1988
- [c1]Christophe Rabut:
Fast Quasi-Interpolation of Surfaces with Generalised B-Splines on Regular Nets. IMA Conference on the Mathematics of Surfaces 1988: 429-450
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: