public class GraphDataOperations
extends java.lang.Object
Modifier and Type | Method and Description |
---|---|
static java.lang.Double[] |
findIntersection(BasicGraphData gd1,
BasicGraphData gd2,
double xMin,
double xMax,
double eps) |
static java.lang.Double[] |
findIntersection(BasicGraphData gd1,
BasicGraphData gd2,
double xMinIni,
double xMaxIni,
double yMinIni,
double yMaxIni,
double eps) |
static java.lang.Double[] |
findIntersection(java.util.Vector<BasicGraphData> gdV,
double xMin,
double xMax,
double eps) |
static java.lang.Double[] |
findIntersection(java.util.Vector<BasicGraphData> gdV,
double xMin,
double xMax,
double yMin,
double yMax,
double eps) |
static java.lang.Double |
findIntersectionX(BasicGraphData gd1,
BasicGraphData gd2,
double xMin,
double xMax,
double eps) |
static java.lang.Double |
findIntersectionX(BasicGraphData gd1,
BasicGraphData gd2,
double xMin,
double xMax,
double yMin,
double yMax,
double eps) |
static java.lang.Double |
findIntersectionX(java.util.Vector<BasicGraphData> gdV,
double xMin,
double xMax,
double eps) |
static java.lang.Double |
findIntersectionX(java.util.Vector<BasicGraphData> gdV,
double xMin,
double xMax,
double yMin,
double yMax,
double eps) |
static java.lang.Double |
findIntersectionY(BasicGraphData gd1,
BasicGraphData gd2,
double xMin,
double xMax,
double eps) |
static java.lang.Double |
findIntersectionY(BasicGraphData gd1,
BasicGraphData gd2,
double xMin,
double xMax,
double yMin,
double yMax,
double eps) |
static java.lang.Double |
findIntersectionY(java.util.Vector<BasicGraphData> gdV,
double xMin,
double xMax,
double eps) |
static java.lang.Double |
findIntersectionY(java.util.Vector<BasicGraphData> gdV,
double xMin,
double xMax,
double yMin,
double yMax,
double eps) |
static java.util.Vector<BasicGraphData> |
getDataInsideRectangle(java.util.Vector<BasicGraphData> gdV,
double xMin,
double xMax,
double yMin,
double yMax)
Returns the vector of BasicGraphData whose
at least one point is inside rectangle.
|
static double |
getExtremumPosition(BasicGraphData gd,
double xMin,
double xMax) |
static java.lang.Object[] |
getGraphDataAndPointIndexInside(java.util.Vector<BasicGraphData> gdV,
double xMin,
double xMax,
double yMin,
double yMax)
Returns graph data object and index of the point that are currently
displayed on the graph pane if it is only one point.
|
static boolean |
isIntersectRectangle(BasicGraphData gd,
double xMin,
double xMax,
double yMin,
double yMax)
Returns true if one of the points is inside rectangle.
|
static void |
main(java.lang.String[] args) |
static double |
polynom(double x,
double[] coeff) |
static double |
polynom(double x,
int order) |
static void |
polynomialFit(BasicGraphData gdSource,
BasicGraphData gdTarget,
double xMin,
double xMax) |
static void |
polynomialFit(BasicGraphData gdSource,
BasicGraphData gdTarget,
double xMin,
double xMax,
int nOrder) |
static void |
polynomialFit(BasicGraphData gdSource,
BasicGraphData gdTarget,
double xMin,
double xMax,
int nOrder,
int nInterP) |
static void |
polynomialFit(BasicGraphData gdSource,
BasicGraphData gdTarget,
int nOrder) |
static double[][] |
polynomialFit(BasicGraphData gd,
double xMin,
double xMax,
int nOrderIn) |
static boolean |
reverseMatrix(double[][] a) |
static double |
unwrap(double y,
double yIn)
this method finds +-2*PI to produce the nearest points
|
static void |
unwrapData(BasicGraphData gd) |
public static java.lang.Double findIntersectionX(java.util.Vector<BasicGraphData> gdV, double xMin, double xMax, double eps)
public static java.lang.Double findIntersectionY(java.util.Vector<BasicGraphData> gdV, double xMin, double xMax, double eps)
public static java.lang.Double[] findIntersection(java.util.Vector<BasicGraphData> gdV, double xMin, double xMax, double eps)
public static java.lang.Double findIntersectionX(java.util.Vector<BasicGraphData> gdV, double xMin, double xMax, double yMin, double yMax, double eps)
public static java.lang.Double findIntersectionY(java.util.Vector<BasicGraphData> gdV, double xMin, double xMax, double yMin, double yMax, double eps)
public static java.lang.Double[] findIntersection(java.util.Vector<BasicGraphData> gdV, double xMin, double xMax, double yMin, double yMax, double eps)
public static java.lang.Double findIntersectionX(BasicGraphData gd1, BasicGraphData gd2, double xMin, double xMax, double eps)
public static java.lang.Double findIntersectionY(BasicGraphData gd1, BasicGraphData gd2, double xMin, double xMax, double eps)
public static java.lang.Double findIntersectionX(BasicGraphData gd1, BasicGraphData gd2, double xMin, double xMax, double yMin, double yMax, double eps)
public static java.lang.Double findIntersectionY(BasicGraphData gd1, BasicGraphData gd2, double xMin, double xMax, double yMin, double yMax, double eps)
public static java.lang.Double[] findIntersection(BasicGraphData gd1, BasicGraphData gd2, double xMin, double xMax, double eps)
public static java.lang.Double[] findIntersection(BasicGraphData gd1, BasicGraphData gd2, double xMinIni, double xMaxIni, double yMinIni, double yMaxIni, double eps)
public static double polynom(double x, int order)
public static double polynom(double x, double[] coeff)
public static double getExtremumPosition(BasicGraphData gd, double xMin, double xMax)
public static void polynomialFit(BasicGraphData gdSource, BasicGraphData gdTarget, double xMin, double xMax)
public static void polynomialFit(BasicGraphData gdSource, BasicGraphData gdTarget, int nOrder)
public static void polynomialFit(BasicGraphData gdSource, BasicGraphData gdTarget, double xMin, double xMax, int nOrder)
public static void polynomialFit(BasicGraphData gdSource, BasicGraphData gdTarget, double xMin, double xMax, int nOrder, int nInterP)
public static double[][] polynomialFit(BasicGraphData gd, double xMin, double xMax, int nOrderIn)
public static boolean reverseMatrix(double[][] a)
public static void unwrapData(BasicGraphData gd)
public static double unwrap(double y, double yIn)
public static java.lang.Object[] getGraphDataAndPointIndexInside(java.util.Vector<BasicGraphData> gdV, double xMin, double xMax, double yMin, double yMax)
public static java.util.Vector<BasicGraphData> getDataInsideRectangle(java.util.Vector<BasicGraphData> gdV, double xMin, double xMax, double yMin, double yMax)
public static boolean isIntersectRectangle(BasicGraphData gd, double xMin, double xMax, double yMin, double yMax)
public static void main(java.lang.String[] args)