---

gunu_interpolate.h

Go to the documentation of this file.

/* LIBGUL - Geometry Utility Library
 * Copyright (C) 1998-1999 Norbert Irmer
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Library General Public
 * License as published by the Free Software Foundation; either
 * version 2 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Library General Public License for more details.
 *
 * You should have received a copy of the GNU Library General Public
 * License along with this library; if not, write to the
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 * Boston, MA 02111-1307, USA.
 */

#ifndef GUNU_INTERPOLATE_H
#define GUNU_INTERPOLATE_H

namespace gunu {

/*----------------------------------------------------------------------
  Calculates the control points of a cubic curve, interpolating
  the data points Q0,..,Qn. (see "The NURBS Book")
  The knot vector U must be computed by the caller.
  The first and last two control points P0,P1,Pn+1,Pn+2, depend
  on the directions & magnitudes of the curve endpoint derivatives,
  and must be filled in by the caller too.
 ----------------------------------------------------------------------*/
template< class T >
GULAPI void CubicCurveInterpolation( int n, Ptr<point<T> > Q, Ptr<T> U,
                                  Ptr<point<T> > P );

/*-----------------------------------------------------------------------
  Creates a non-homogeneous NURBS curve, which interpolates a set of 'n+1'
  data points 'Q' with "Local Bicubic Interpolation" (see "The NURBS Book").
  For each data point two control points are generated. Storage for
  the output arrays 'U' and 'P' must be reserved by the caller:

  For P: (n+1)*2
  For U: ((n+1)*2 + 4)
-------------------------------------------------------------------- */  
template< class K >
GULAPI void CubicLocalCurveInterpolation( 
                            int n, Ptr< point<K> > Q, bool cornerflag,
                            Ptr<K> U, Ptr< point<K> > P );

/*-----------------------------------------------------------------------
  Creates a non-homogeneous NURBS surface, which interpolates a net of 
  'm+1' * 'n+1' data points 'Q' with "Local Bicubic Interpolation" 
  (see "The NURBS Book"). For each data point two control points are generated. Storage for
  the output arrays 'U','V' and 'controlPoints' must be reserved by the caller:

  For controlPoints: (m+1)*(n+1)*2*sizeof(NUPoint)  
  For U: ((n+1)*2 + 4)
  For V: ((m+1)*2 + 4)
-------------------------------------------------------------------- */  
template< class T, class HP >
GULAPI void CubicLocalSurfaceInterpolation( 
           int n, int m, Ptr< Ptr< point<T> > > Q, bool cornerflag,
           Ptr<T> U, Ptr<T> V, Ptr< Ptr< HP > > controlPoints );

}

#endif

---