Java Crossing类代码示例

import org.apache.harmony.awt.gl.Crossing; //导入依赖的package包/类
/**
 * It checks up if there is intersection of the line (x1, y1) - (x2, y2) and
 * the quad curve (qx1, qy1) - (qx2, qy2) - (qx3, qy3). The parameters of the intersection
 * area saved to params array. Therefore the params size must be at learst 4.
 * @return The method returns the quantity of roots lied in the defined interval 
 */
public static int intersectLineAndQuad(double x1, double y1, double x2, double y2,
                                       double qx1, double qy1, double qx2, double qy2, 
                                       double qx3, double qy3, double[] params) {
    double[] eqn = new double[3];
    double[] t = new double[2];
    double[] s = new double[2];
    double dy = y2 - y1;
    double dx = x2 - x1;
    int quantity = 0;
    int count = 0;

    eqn[0] = dy * (qx1 - x1) - dx * (qy1 - y1);
    eqn[1] = 2 * dy * (qx2 - qx1) - 2 * dx * (qy2 - qy1);
    eqn[2] = dy * (qx1 - 2 * qx2 + qx3) - dx *(qy1 -2 * qy2 + qy3);
    
    if ((count = Crossing.solveQuad(eqn, t)) == 0) {
        return 0;
    }

    for (int i = 0; i < count; i++) {
        if (dx != 0) {
            s[i] = (quad(t[i], qx1, qx2, qx3) - x1) / dx;
        } else if (dy != 0) {
            s[i] = (quad(t[i], qy1, qy2, qy3) - y1) / dy;
        } else {
        	s[i] = 0.0;
        }
        if (t[i] >= 0 && t[i] <= 1 && s[i] >= 0 && s[i] <= 1) {
            params[2 * quantity] = t[i];
            params[2 * quantity + 1] = s[i];
            ++quantity;
        }
    }

    return quantity;
}
 

import org.apache.harmony.awt.gl.Crossing; //导入依赖的package包/类
/**
 * It checks up if the line (x1, y1) - (x2, y2) and
 * the cubic curve (cx1, cy1) - (cx2, cy2) - (cx3, cy3) - (cx4, cy4). 
 * The points of the intersection is saved to points array. 
 * Therefore the points size must be at learst 6. 
 * @return The method returns the quantity of roots lied in the defined interval 
 */
public static int intersectLineAndCubic(double x1, double y1, double x2, double y2,
                                        double cx1, double cy1, double cx2, double cy2,
                                        double cx3, double cy3, double cx4, double cy4,
                                        double[] params) {
    double[] eqn = new double[4];
    double[] t = new double[3];
    double[] s = new double[3];
    double dy = y2 - y1;
    double dx = x2 - x1;
    int quantity = 0;
    int count = 0;

    eqn[0] = (cy1 - y1) * dx + (x1 - cx1) * dy;
    eqn[1] = - 3 * (cy1 - cy2) * dx + 3 * (cx1 - cx2) * dy ;
    eqn[2] = (3 * cy1 - 6 * cy2 + 3 * cy3) * dx - (3 * cx1 - 6 * cx2 + 3 * cx3) * dy;
    eqn[3] = (- 3 * cy1 + 3 * cy2 - 3 * cy3 + cy4) * dx + 
    		 (3 * cx1 - 3 * cx2 + 3 * cx3 - cx4) * dy;

    if ((count = Crossing.solveCubic(eqn, t)) == 0) {
        return 0;
    }
    
    for (int i = 0; i < count; i++) {
        if (dx != 0) {
            s[i] = (cubic(t[i], cx1, cx2, cx3, cx4) - x1) / dx;
        } else if (dy != 0) {
            s[i] = (cubic(t[i], cy1, cy2, cy3, cy4) - y1) / dy;
        } else {
        	s[i] = 0.0;
        }
        if (t[i] >= 0 && t[i] <= 1 && s[i] >= 0 && s[i] <= 1) {
            params[2 * quantity] = t[i];
            params[2 * quantity + 1] = s[i];
            ++quantity;
        }
    }

    return quantity;
}
 

import org.apache.harmony.awt.gl.Crossing; //导入依赖的package包/类
/**
 * Checks cross count according to path rule to define is it point inside shape or not. 
 * @param cross - the point cross count
 * @return true if point is inside path, or false otherwise 
 */
boolean isInside(int cross) {
    if (rule == WIND_NON_ZERO) {
        return Crossing.isInsideNonZero(cross);
    }
    return Crossing.isInsideEvenOdd(cross);
}
 

import org.apache.harmony.awt.gl.Crossing; //导入依赖的package包/类
public boolean intersects(double x, double y, double width, double height) {
	if ((width <= 0.0) || (height <= 0.0)) {
		return false;
	} else if (!getBounds2D().intersects(x, y, width, height)) {
		return false;
	}
	
	int crossCount = Crossing.intersectShape(this, x, y, width, height);
	return Crossing.isInsideEvenOdd(crossCount);
}
 

import org.apache.harmony.awt.gl.Crossing; //导入依赖的package包/类
public boolean intersects(double x, double y, double width, double height) {
	if ((width <= 0.0) || (height <= 0.0)) {
		return false;
	} else if (!getBounds2D().intersects(x, y, width, height)) {
		return false;
	}

	int crossCount = Crossing.intersectShape(this, x, y, width, height);
	return Crossing.isInsideEvenOdd(crossCount);
}
 

import org.apache.harmony.awt.gl.Crossing; //导入依赖的package包/类
/**
 * It checks up if there is intersection of the line (x1, y1) - (x2, y2) and
 * the quad curve (qx1, qy1) - (qx2, qy2) - (qx3, qy3). The parameters of
 * the intersection area saved to params array. Therefore the params size
 * must be at learst 4.
 * 
 * @return The method returns the quantity of roots lied in the defined
 *         interval
 */
public static int intersectLineAndQuad(double x1, double y1, double x2, double y2, double qx1, double qy1,
		double qx2, double qy2, double qx3, double qy3, double[] params) {
	double[] eqn = new double[3];
	double[] t = new double[2];
	double[] s = new double[2];
	double dy = y2 - y1;
	double dx = x2 - x1;
	int quantity = 0;
	int count = 0;

	eqn[0] = dy * (qx1 - x1) - dx * (qy1 - y1);
	eqn[1] = 2 * dy * (qx2 - qx1) - 2 * dx * (qy2 - qy1);
	eqn[2] = dy * (qx1 - 2 * qx2 + qx3) - dx * (qy1 - 2 * qy2 + qy3);

	if ((count = Crossing.solveQuad(eqn, t)) == 0) {
		return 0;
	}

	for (int i = 0; i < count; i++) {
		if (dx != 0) {
			s[i] = (quad(t[i], qx1, qx2, qx3) - x1) / dx;
		} else if (dy != 0) {
			s[i] = (quad(t[i], qy1, qy2, qy3) - y1) / dy;
		} else {
			s[i] = 0.0;
		}
		if (t[i] >= 0 && t[i] <= 1 && s[i] >= 0 && s[i] <= 1) {
			params[2 * quantity] = t[i];
			params[2 * quantity + 1] = s[i];
			++quantity;
		}
	}

	return quantity;
}
 

import org.apache.harmony.awt.gl.Crossing; //导入依赖的package包/类
/**
 * It checks up if the line (x1, y1) - (x2, y2) and the cubic curve (cx1,
 * cy1) - (cx2, cy2) - (cx3, cy3) - (cx4, cy4). The points of the
 * intersection is saved to points array. Therefore the points size must be
 * at learst 6.
 * 
 * @return The method returns the quantity of roots lied in the defined
 *         interval
 */
public static int intersectLineAndCubic(double x1, double y1, double x2, double y2, double cx1, double cy1,
		double cx2, double cy2, double cx3, double cy3, double cx4, double cy4, double[] params) {
	double[] eqn = new double[4];
	double[] t = new double[3];
	double[] s = new double[3];
	double dy = y2 - y1;
	double dx = x2 - x1;
	int quantity = 0;
	int count = 0;

	eqn[0] = (cy1 - y1) * dx + (x1 - cx1) * dy;
	eqn[1] = -3 * (cy1 - cy2) * dx + 3 * (cx1 - cx2) * dy;
	eqn[2] = (3 * cy1 - 6 * cy2 + 3 * cy3) * dx - (3 * cx1 - 6 * cx2 + 3 * cx3) * dy;
	eqn[3] = (-3 * cy1 + 3 * cy2 - 3 * cy3 + cy4) * dx + (3 * cx1 - 3 * cx2 + 3 * cx3 - cx4) * dy;

	if ((count = Crossing.solveCubic(eqn, t)) == 0) {
		return 0;
	}

	for (int i = 0; i < count; i++) {
		if (dx != 0) {
			s[i] = (cubic(t[i], cx1, cx2, cx3, cx4) - x1) / dx;
		} else if (dy != 0) {
			s[i] = (cubic(t[i], cy1, cy2, cy3, cy4) - y1) / dy;
		} else {
			s[i] = 0.0;
		}
		if (t[i] >= 0 && t[i] <= 1 && s[i] >= 0 && s[i] <= 1) {
			params[2 * quantity] = t[i];
			params[2 * quantity + 1] = s[i];
			++quantity;
		}
	}

	return quantity;
}
 

import org.apache.harmony.awt.gl.Crossing; //导入依赖的package包/类
public boolean contains(double px, double py) {
    return isInside(Crossing.crossShape(this, px, py));
}
 

import org.apache.harmony.awt.gl.Crossing; //导入依赖的package包/类
public boolean intersects(double rx, double ry, double rw, double rh) {
    int cross = Crossing.intersectShape(this, rx, ry, rw, rh);
    return cross == Crossing.CROSSING || isInside(cross);
}
 

import org.apache.harmony.awt.gl.Crossing; //导入依赖的package包/类
public boolean contains(double px, double py) {
    return Crossing.isInsideEvenOdd(Crossing.crossShape(this, px, py));
}
 

import org.apache.harmony.awt.gl.Crossing; //导入依赖的package包/类
public boolean intersects(double rx, double ry, double rw, double rh) {
    int cross = Crossing.intersectShape(this, rx, ry, rw, rh);
    return cross == Crossing.CROSSING || Crossing.isInsideEvenOdd(cross);
}
 

import org.apache.harmony.awt.gl.Crossing; //导入依赖的package包/类
public boolean contains(double x, double y) {
    return Crossing.isInsideEvenOdd(Crossing.crossShape(this, x, y));
}
 

import org.apache.harmony.awt.gl.Crossing; //导入依赖的package包/类
public boolean intersects(double x, double y, double width, double height) {
    int cross = Crossing.intersectShape(this, x, y, width, height);
    return cross == Crossing.CROSSING || Crossing.isInsideEvenOdd(cross);
}
 

import org.apache.harmony.awt.gl.Crossing; //导入依赖的package包/类
public static int solveQuadratic(double eqn[], double res[]) {
    return Crossing.solveQuad(eqn, res);
}
 

import org.apache.harmony.awt.gl.Crossing; //导入依赖的package包/类
public static int solveCubic(double eqn[], double res[]) {
    return Crossing.solveCubic(eqn, res);
}