NearestNeighborIpol.hpp

//
// $Id: NearestNeighborIpol.hpp,v 1.1 2006/07/07 14:10:53 werner Exp $
//
// $Log: NearestNeighborIpol.hpp,v $
// Revision 1.1  2006/07/07 14:10:53  werner
// Intermediate state: multidimensional interpolation with on-demand
// fractional loading appears to work, but still problem with vectorfield
// interpolation.
//
// Revision 1.4  2004/08/12 16:08:45  werner
// Various improvements for implementing the tangential space
//
// Revision 1.3  2004/07/09 20:15:26  werner
// Added local alignment capability when interpolating vector fields and
// option to compute the interpolated derivative.
//
// Revision 1.2  2004/07/04 17:24:03  werner
// Recursive multidimensional Interpolation interface implemented.
//
// Revision 1.1  2004/06/15 22:45:31  werner
// Enhanced the fixed array member functions.
// Using better name for interpolation template parameters.
//
// Revision 1.1  2004/06/14 22:42:00  werner
// Moved interpolation files from light++ to VecAl and Multindex from Fiber to VecAl.
//
#ifndef __IPOL_CONSTANT_HPP
#define __IPOL_CONSTANT_HPP "Created 11.06.2004 22:28:21 by bzfbenge"

#include "Index.hpp"
#include <assert.h>

namespace Fiber
{

template <class T>
class   NearestNeighborIpol
{

public:

        template <class Storage1D, class Limiter>
static  T interpolate(const Storage1D&Data, double t, index_t size, const Limiter&L)
        {
                // TODO: Check for Samplings.size() < 2 !
                assert(size > 2);

                if (t<0     ) return Data[0];
                if (t>=size ) return Data[size-1];

        index_t i = index_t(t+0.5);

                return Data[i];
        }

        template <class Storage1D>
static  T derivative(const Storage1D&Data, double t, index_t size)
        {
                return 0;
        }
};

} /* namespace VecAl */ 

#endif /* __IPOL_CONSTANT_HPP */