Distorted Android

///////////////////////////////////////////////////////////////////////////////////////////////////

// Copyright 2016 Leszek Koltunski                                                               //

//                                                                                               //

// This file is part of Distorted.                                                               //

//                                                                                               //

// Distorted is free software: you can redistribute it and/or modify                             //

// it under the terms of the GNU General Public License as published by                          //

// the Free Software Foundation, either version 2 of the License, or                             //

// (at your option) any later version.                                                           //

//                                                                                               //

// Distorted 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 General Public License for more details.                                                  //

//                                                                                               //

// You should have received a copy of the GNU General Public License                             //

// along with Distorted.  If not, see <http://www.gnu.org/licenses/>.                            //

///////////////////////////////////////////////////////////////////////////////////////////////////

package org.distorted.library.type;

import java.util.Vector;

///////////////////////////////////////////////////////////////////////////////////////////////////

/** 

* A 4-dimensional implementation of the Dynamic class to interpolate between a list

* of Static4Ds.

* Here, the Points are assumed to be Quaternions - thus we do the Spherical Linear Interpolation, aka

* SLERP. Noise not supported (yet?).

*/

public class DynamicQuat extends Dynamic implements Data4D

  {

///////////////////////////////////////////////////////////////////////////////////////////////////

// omega, sinOmega, cosOmega - angle between pair of quaternions, its sinus and cosinus.

//  

// (vx,vy,vz,vw) is the original vector from vv (copied here so when interpolating we can see if it is 

// still valid and if not - rebuild the Cache

  private class VectorCache

    {

    float omega, sinOmega,cosOmega;

    float vx,vy,vz,vw;

    }

  private Vector<VectorCache> vc;

  private VectorCache tmp1, tmp2;

  private Vector<Static4D> vv;

  private Static4D curr, next;

///////////////////////////////////////////////////////////////////////////////////////////////////

//Abramowitz / Stegun

  private static float arcCos(float x)

    {

    if( x<0 )

      return 3.14159265358979f - (float)Math.sqrt(1+x)*(1.5707288f + 0.2121144f*x + 0.074261f*x*x + 0.0187293f*x*x*x);

    return (float)Math.sqrt(1-x)*(1.5707288f - 0.2121144f*x + 0.074261f*x*x - 0.0187293f*x*x*x);

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

// Quaternion Dynamic doesn't support noise

  synchronized void createNoise()

    {

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private void recomputeCache()

    {  

    if( numPoints>=2 )

      {

      int i, n;  

      for(i=0; i<numPoints; i++)

        {

        n = i<numPoints-1 ? i+1:0;  

        tmp1= vc.elementAt(i);

        tmp2= vc.elementAt(n);

        curr= vv.elementAt(i);

        next= vv.elementAt(n);

        tmp1.vx = curr.x;

        tmp1.vy = curr.y;

        tmp1.vz = curr.z;

        tmp1.vw = curr.w;

        tmp1.cosOmega = curr.x*next.x + curr.y*next.y + curr.z*next.z + curr.w*next.w;

        if( tmp1.cosOmega<0 && n!=0 )  // do not invert the last quaternion even if we'd have to go the long way around!

          {

          tmp1.cosOmega = -tmp1.cosOmega;

          next.x = -next.x;

          next.y = -next.y;

          next.z = -next.z;

          next.w = -next.w;

          }

        tmp1.sinOmega = (float)Math.sqrt(1-tmp1.cosOmega*tmp1.cosOmega);

        tmp1.omega = arcCos(tmp1.cosOmega);

        }

      }

    cacheDirty = false;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

// PUBLIC API

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * Default constructor.

 */

  public DynamicQuat()

    {

    vv = new Vector<>();

    vc = new Vector<>();

    numPoints = 0;

    cacheDirty = false;

    mMode = MODE_LOOP;

    mDuration = 0;

    mCount = 0.5f;

    mNoise = 0.0f;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * Default constructor.

 *

 * @param duration number of milliseconds it takes to do a full loop/path from first vector to the

 *                 last and back to the first

 * @param count    number of loops/paths we will do; mCount = 1.5 means we go from the first vector

 *                 to the last, back to first, and to the last again.

 */

  public DynamicQuat(int duration, float count)

    {

    vv = new Vector<>();

    vc = new Vector<>();

    numPoints = 0;

    cacheDirty = false;

    mMode = MODE_LOOP;

    mDuration = duration;

    mCount = count;

    mNoise = 0.0f;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * Returns the location'th Static4D.

 *   

 * @param location the index of the Point we are interested in.

 * @return The Static4D, if 0<=location&lt;getNumPoints(), or null otherwise.

 */  

  public synchronized Static4D getPoint(int location)

    {

    return (location>=0 && location<numPoints) ? vv.elementAt(location) : null;  

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * Resets the location'th Point.

 * 

 * @param location the index of the Point we are setting.

 * @param x New value of its first float.

 */

  public synchronized void setPoint(int location, float x, float y, float z, float w)

    {

    if( location>=0 && location<numPoints )

      {

      curr = vv.elementAt(location);

      if( curr!=null )

        {

        curr.set(x,y,z,w);

        cacheDirty=true;

        }

      }

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * Adds a new Static4D to the end of our list of Points to interpolate through.

 * <p>   

 * Only a reference to the Point gets added to the List; this means that one can add a Point 

 * here, and later on {@link Static4D#set(float,float,float,float)} it to some new value and

 * the change will be seamlessly reflected in the interpolated path.  

 * <p>

 * A Point can be added multiple times.

 *   

 * @param v The Point to add.

 */    

  public synchronized void add(Static4D v)

    {

    if( v!=null )

      {

      vv.add(v);

      switch(numPoints)

         {

         case 0: 

         case 1: vc.add(new VectorCache());

                 vc.add(new VectorCache());

        	     break;

         default:vc.add(new VectorCache());

         }

       numPoints++;

       cacheDirty = true;

       }

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * Adds a new Static4D to the location'th place in our List of Points to interpolate through.

 *   

 * @param location Index in our List to add the new Point at.

 * @param v The Static4D to add.

 */  

  public synchronized void add(int location, Static4D v)

    {

    if( v!=null )

      {

      vv.add(location, v);

      switch(numPoints)

        {

        case 0: 

        case 1: vc.add(new VectorCache());

                vc.add(new VectorCache());

                break;

        default:vc.add(location,new VectorCache());

        }

      numPoints++;

      cacheDirty = true;

      }

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * Removes all occurrences of Point v from the List of Points to interpolate through.  

 * 

 * @param v The Point to remove.

 * @return <code>true</code> if we have removed at least one Point.

 */

  public synchronized boolean remove(Static4D v)

    {

    int n = vv.indexOf(v);

    boolean found = false;

    while( n>=0 ) 

      {

      vv.remove(n);

      switch(numPoints)

        {

        case 0:

        case 1: break;

        case 2: vc.removeAllElements();

                break;

        default:vc.remove(n);

        }

      numPoints--;

      found = true;

      n = vv.indexOf(v);

      }

    if( found ) 

      {

      cacheDirty=true;

      }

    return found;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * Removes a location'th Point from the List of Points we interpolate through.

 * 

 * @param location index of the Point we want to remove. 

 * @return <code>true</code> if location is valid, i.e. if 0<=location&lt;getNumPoints().

 */

  public synchronized boolean remove(int location)

    {

    if( location>=0 && location<numPoints ) 

      {

      vv.removeElementAt(location);

      switch(numPoints)

        {

        case 0: 

        case 1: break;

        case 2: vc.removeAllElements();

                break;

        default:vc.removeElementAt(location);

        }

      numPoints--;

      cacheDirty = true; 

      return true;

      }

    return false;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * Removes all Points.

 */

  public synchronized void removeAll()

    {

    numPoints = 0;

    vv.removeAllElements();

    vc.removeAllElements();

    cacheDirty = false;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * Writes the results of interpolation between the Points at time 'time' to the passed float buffer.

 * Interpolation is done using the spherical linear algorithm, aka SLERP.

 * <p>

 * Since this is a 4-dimensional Dynamic, the resulting interpolated Static4D gets written

 * to four locations in the buffer: buffer[offset], buffer[offset+1], buffer[offset+2] and buffer[offset+3]. 

 * 

 * @param buffer Float buffer we will write the resulting Static4D to.

 * @param offset Offset in the buffer where to write the result.

 * @param time Time of interpolation. Time=0.0 would return the first Point, Time=0.5 - the last,

 *             time=1.0 - the first again, and time 0.1 would be 1/5 of the way between the first and the last Points.

 */    

  public synchronized void interpolate(float[] buffer, int offset, float time)

    {  

    switch(numPoints)

      {

      case 0: buffer[offset  ] = 0.0f;

              buffer[offset+1] = 0.0f;

              buffer[offset+2] = 0.0f;

              buffer[offset+3] = 0.0f;

              break;

      case 1: curr = vv.elementAt(0);

              buffer[offset  ] = curr.x; 

              buffer[offset+1] = curr.y;

              buffer[offset+2] = curr.z;

              buffer[offset+3] = curr.w;

              break;

      default:float t = time;

              float scale0, scale1;

              if( mMode==MODE_JUMP ) time = time*(numPoints-1);

              else if( mMode==MODE_PATH || numPoints==2 ) time = (time<=0.5f) ? 2*time*(numPoints-1) : 2*(1-time)*(numPoints-1);

              else time = time*numPoints;

              int vecNext, vecCurr = (int)time;

              time = time-vecCurr;

              if( vecCurr>=0 && vecCurr<numPoints )

                {

                if( cacheDirty ) recomputeCache();    // recompute cache if we have added or remove vectors since last computation

                switch(mMode)

                  {

                  case MODE_LOOP: vecNext = vecCurr==numPoints-1 ? 0:vecCurr+1; 

                                  break;

                  case MODE_PATH: if( t<0.5f ) vecNext = vecCurr+1;  

                                  else         vecNext = vecCurr==0 ? 1 : vecCurr-1;  

                                  break;

                  case MODE_JUMP: vecNext = vecCurr==numPoints-1 ? 1:vecCurr+1;

                                  break;

                  default       : vecNext = 0;                

                  }

                curr = vv.elementAt(vecCurr);

                next = vv.elementAt(vecNext);

                tmp1 = vc.elementAt(vecCurr);

                tmp2 = vc.elementAt(vecNext);

                if( tmp2.vx!=next.x || tmp2.vy!=next.y || tmp2.vz!=next.z || tmp2.vw!=next.w ) recomputeCache();

                if( tmp1.sinOmega==0 )

                  {

                  scale0 = 0f;

                  scale1 = 1f;

                  }

                else if( tmp1.cosOmega < 0.99 ) 

                  {

                  scale0 = (float)Math.sin( (1f-time)*tmp1.omega ) / tmp1.sinOmega;

                  scale1 = (float)Math.sin(     time *tmp1.omega ) / tmp1.sinOmega;

                  }

                else 

                  {

                  scale0 = 1f-time;

                  scale1 = time;

                  }

                buffer[offset  ] = scale0*curr.x + scale1*next.x;

                buffer[offset+1] = scale0*curr.y + scale1*next.y; 

                buffer[offset+2] = scale0*curr.z + scale1*next.z; 

                buffer[offset+3] = scale0*curr.w + scale1*next.w; 

                break;

                }

      }

    }  

  }

///////////////////////////////////////////////////////////////////////////////////////////////////

//