我正在检查实体与实体的交集。我的方法是:

public boolean intersects(Entity e) {
    int r1x1 = this.posPoint.x;
    int r1x2 = this.posPoint.x + texture.w;
    int r2x1 = e.posPoint.x;
    int r2x2 = e.posPoint.x + e.texture.w;

    int r1y1 = this.posPoint.y;
    int r1y2 = this.posPoint.y + texture.h;
    int r2y1 = e.posPoint.y;
    int r2y2 = e.posPoint.y + e.texture.h;
    // ALTEA!
    return ((r1x2 >= r2x1) && (r1y2 >= r2y1) && (r1x1 <= r2x2) && (r1y1 <= r2y2));
}


实体相交时如何获得点/点阵列?

大泰迪

最佳答案

实体相交时如何获得点/点阵列?
我不确定为什么要数组?如果要知道两个点是否相交,请使用Distance Formula

09-06 10:38