
com.metsci.glimpse.util.math.approx.ApproxSin Maven / Gradle / Ivy
/*
* Copyright (c) 2020, Metron, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of Metron, Inc. nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL METRON, INC. BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package com.metsci.glimpse.util.math.approx;
import static com.metsci.glimpse.util.math.MathConstants.TWO_PI;
import static java.lang.Math.floor;
/**
* Similar to the classes in {@link com.metsci.glimpse.util.math.fast}, but uses linear interpolation
* between samples instead of nearest-neighbor.
*
* Anecdotally, speed is about 12x faster than {@link Math#sin(double)}. With 100k samples, max error
* is around 5e-10. Max error decreases as the number of samples increases.
*/
public class ApproxSin
{
public static final double ONE_OVER_TWO_PI = 1.0 / TWO_PI;
protected final int n;
protected final double xMin;
protected final double xMax;
protected final double xStep;
protected final double oneOverXStep;
protected final double[] y;
public ApproxSin( int numSamples )
{
double xMinPrelim = 0.0;
double xMaxPrelim = TWO_PI;
double xStepPrelim = ( xMaxPrelim - xMinPrelim ) / ( numSamples - 1 );
// Avoid edge effects by tacking on an extra sample at each end
this.n = numSamples + 2;
this.xMin = xMinPrelim - xStepPrelim;
this.xMax = xMaxPrelim + xStepPrelim;
this.xStep = ( this.xMax - this.xMin ) / ( this.n - 1 );
this.oneOverXStep = 1.0 / this.xStep;
this.y = new double[ this.n ];
for ( int i = 0; i < this.n; i++ )
{
double x = this.xMin + ( i * this.xStep );
this.y[ i ] = Math.sin( x );
}
}
public static double normalizeAngleTwoPi( double x_RAD )
{
return ( x_RAD - ( TWO_PI * floor( x_RAD * ONE_OVER_TWO_PI ) ) );
}
public double sin( double x_RAD )
{
double x = normalizeAngleTwoPi( x_RAD );
// How many steps is x above xMin
double w = ( x - this.xMin ) * this.oneOverXStep;
int iBefore = ( int ) w;
double yBefore = this.y[ iBefore ];
double yAfter = this.y[ iBefore + 1 ];
double xFrac = w - iBefore;
return ( yBefore + ( xFrac * ( yAfter - yBefore ) ) );
}
}