1*b1cdbd2cSJim Jagielski/************************************************************** 2*b1cdbd2cSJim Jagielski * 3*b1cdbd2cSJim Jagielski * Licensed to the Apache Software Foundation (ASF) under one 4*b1cdbd2cSJim Jagielski * or more contributor license agreements. See the NOTICE file 5*b1cdbd2cSJim Jagielski * distributed with this work for additional information 6*b1cdbd2cSJim Jagielski * regarding copyright ownership. The ASF licenses this file 7*b1cdbd2cSJim Jagielski * to you under the Apache License, Version 2.0 (the 8*b1cdbd2cSJim Jagielski * "License"); you may not use this file except in compliance 9*b1cdbd2cSJim Jagielski * with the License. You may obtain a copy of the License at 10*b1cdbd2cSJim Jagielski * 11*b1cdbd2cSJim Jagielski * http://www.apache.org/licenses/LICENSE-2.0 12*b1cdbd2cSJim Jagielski * 13*b1cdbd2cSJim Jagielski * Unless required by applicable law or agreed to in writing, 14*b1cdbd2cSJim Jagielski * software distributed under the License is distributed on an 15*b1cdbd2cSJim Jagielski * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY 16*b1cdbd2cSJim Jagielski * KIND, either express or implied. See the License for the 17*b1cdbd2cSJim Jagielski * specific language governing permissions and limitations 18*b1cdbd2cSJim Jagielski * under the License. 19*b1cdbd2cSJim Jagielski * 20*b1cdbd2cSJim Jagielski *************************************************************/ 21*b1cdbd2cSJim Jagielski 22*b1cdbd2cSJim Jagielski 23*b1cdbd2cSJim Jagielski#ifndef __com_sun_star_rendering_InterpolationMode_idl__ 24*b1cdbd2cSJim Jagielski#define __com_sun_star_rendering_InterpolationMode_idl__ 25*b1cdbd2cSJim Jagielski 26*b1cdbd2cSJim Jagielskimodule com { module sun { module star { module rendering { 27*b1cdbd2cSJim Jagielski 28*b1cdbd2cSJim Jagielski/** These constants specify the interpolation type for animation 29*b1cdbd2cSJim Jagielski frames.<p> 30*b1cdbd2cSJim Jagielski 31*b1cdbd2cSJim Jagielski With this constants, one specifies the way of interpolation that 32*b1cdbd2cSJim Jagielski takes place between two consecutive frames of a discrete animation 33*b1cdbd2cSJim Jagielski sequence. 34*b1cdbd2cSJim Jagielski 35*b1cdbd2cSJim Jagielski @since OpenOffice 2.0 36*b1cdbd2cSJim Jagielski */ 37*b1cdbd2cSJim Jagielskiconstants InterpolationMode 38*b1cdbd2cSJim Jagielski{ 39*b1cdbd2cSJim Jagielski /** Perform a nearest neighbor interpolation.<p> 40*b1cdbd2cSJim Jagielski 41*b1cdbd2cSJim Jagielski That is, when interpolating between two values v0 and v1, 42*b1cdbd2cSJim Jagielski positioned at t0 and t1, take the one which has the closest t 43*b1cdbd2cSJim Jagielski coordinate.<p> 44*b1cdbd2cSJim Jagielski */ 45*b1cdbd2cSJim Jagielski const byte NEAREST_NEIGHBOR=1; 46*b1cdbd2cSJim Jagielski 47*b1cdbd2cSJim Jagielski //------------------------------------------------------------------------- 48*b1cdbd2cSJim Jagielski 49*b1cdbd2cSJim Jagielski /** Perform a linear interpolation.<p> 50*b1cdbd2cSJim Jagielski 51*b1cdbd2cSJim Jagielski That is, when interpolating at position t between two values 52*b1cdbd2cSJim Jagielski v0 and v1, positioned at t0 and t1, take the sum of v0 53*b1cdbd2cSJim Jagielski weighted with (t-t0) and v1 weighted with (t1-t).<p> 54*b1cdbd2cSJim Jagielski */ 55*b1cdbd2cSJim Jagielski const byte LINEAR=2; 56*b1cdbd2cSJim Jagielski 57*b1cdbd2cSJim Jagielski //------------------------------------------------------------------------- 58*b1cdbd2cSJim Jagielski 59*b1cdbd2cSJim Jagielski /** Perform a cubic interpolation.<p> 60*b1cdbd2cSJim Jagielski 61*b1cdbd2cSJim Jagielski That is, when interpolating at position t, take the four 62*b1cdbd2cSJim Jagielski closest data points v0, v1, v2, and v3, fit a cubic curve 63*b1cdbd2cSJim Jagielski through them, and take the interpolated value from this cubic 64*b1cdbd2cSJim Jagielski curve.<p> 65*b1cdbd2cSJim Jagielski */ 66*b1cdbd2cSJim Jagielski const byte CUBIC=3; 67*b1cdbd2cSJim Jagielski 68*b1cdbd2cSJim Jagielski //------------------------------------------------------------------------- 69*b1cdbd2cSJim Jagielski 70*b1cdbd2cSJim Jagielski /** Perform a cubic bezier spline interpolation.<p> 71*b1cdbd2cSJim Jagielski 72*b1cdbd2cSJim Jagielski That is, when interpolating at position t, take the three 73*b1cdbd2cSJim Jagielski closest data points v0, v1, and v2, fit a cubic bezier spline 74*b1cdbd2cSJim Jagielski through them, and take the interpolated value from this cubic 75*b1cdbd2cSJim Jagielski curve.<p> 76*b1cdbd2cSJim Jagielski */ 77*b1cdbd2cSJim Jagielski const byte BEZIERSPLINE3=4; 78*b1cdbd2cSJim Jagielski 79*b1cdbd2cSJim Jagielski //------------------------------------------------------------------------- 80*b1cdbd2cSJim Jagielski 81*b1cdbd2cSJim Jagielski /** Perform a quadric bezier spline interpolation.<p> 82*b1cdbd2cSJim Jagielski 83*b1cdbd2cSJim Jagielski That is, when interpolating at position t, take the four 84*b1cdbd2cSJim Jagielski closest data points v0, v1, v2, and v3, fit a quadric bezier 85*b1cdbd2cSJim Jagielski spline through them, and take the interpolated value from this 86*b1cdbd2cSJim Jagielski quadric curve.<p> 87*b1cdbd2cSJim Jagielski */ 88*b1cdbd2cSJim Jagielski const byte BEZIERSPLINE4=5; 89*b1cdbd2cSJim Jagielski}; 90*b1cdbd2cSJim Jagielski 91*b1cdbd2cSJim Jagielski}; }; }; }; 92*b1cdbd2cSJim Jagielski 93*b1cdbd2cSJim Jagielski#endif 94