j2me中计算两矩形的相交区域算法

最新推荐文章于 2024-10-15 19:28:18 发布

bearfirstblog

最新推荐文章于 2024-10-15 19:28:18 发布

阅读量595

点赞数

分类专栏： Java编程技巧文章标签： j2me 算法

本文链接：https://blog.csdn.net/bearfirstblog/article/details/2451170

版权

Java编程技巧专栏收录该内容

0 篇文章 0 订阅

订阅专栏

    public Region intersection(Region r) {
        int tx1 = this.x;
        int ty1 = this.y;
        int rx1 = r.x;
        int ry1 = r.y;
        long tx2 = tx1;
        tx2 += this.width;
        long ty2 = ty1;
        ty2 += this.height;
        long rx2 = rx1;
        rx2 += r.width;
        long ry2 = ry1;
        ry2 += r.height;
        if (tx1 < rx1) tx1 = rx1;
        if (ty1 < ry1) ty1 = ry1;
        if (tx2 > rx2) tx2 = rx2;
        if (ty2 > ry2) ty2 = ry2;
        tx2 -= tx1;
        ty2 -= ty1;
        // tx2,ty2 will never overflow (they will never be
        // larger than the smallest of the two source w,h)
        // they might underflow, though...
        if (tx2 < Integer.MIN_VALUE) tx2 = Integer.MIN_VALUE;
        if (ty2 < Integer.MIN_VALUE) ty2 = Integer.MIN_VALUE;
        return new Region(tx1, ty1, (int) tx2, (int) ty2);
    }
该段代码摘自 java.awt.RectAngle.在j2me中没有矩形的运算，如果需要的话，可移植此段代码到程序中