简体   繁体   English

在Java中旋转矩形

[英]Rotate Rectangle in Java

I need to create rectangles that are rotated around their center (so they don't need to be parallel to the axes of the coordinate system). 我需要创建围绕其中心旋转的矩形(因此它们不需要与坐标系的轴平行)。 So basicelly each rectangle can be defined by center-X , center-Y , width , height and angle . 所以basicly每个矩形可以由center-Xcenter-Ywidthheightangle定义 What I want to do then is to perform calculations on whether certain points are contained in these rectangles or not (so no drawing will be involved). 我想要做的是对这些矩形中是否包含某些点进行计算(因此不涉及绘图)。 I guess I cant use the Rectangle2D class because these rectangles will always be parallel to the x and y-axis of the coordinate system. 我想我不能使用Rectangle2D类,因为这些矩形将始终与坐标系的x和y轴平行。 Is the only way to get this functionality by writing my own rectangle class or is there anything existing (similar to Rectangle2D ) I can use? 是通过编写我自己的矩形类来获得此功能的唯一方法,还是可以使用任何现有的(类似于Rectangle2D )?

Rotate all the points you want to test and use contains(Point) method of the Rectangle2D as Mihai did. 旋转你要测试的所有点,并使用Recthai2D的contains(Point)方法作为Mihai。

But if you really want to rotate the rectangles you can do it like this (this is the integer version but probably you can do it with Rectangle2D aswell :)). 但是如果你真的想要旋转矩形,你可以像这样做(这是整数版本,但你可以用Rectangle2D做到这一点:))。

public class TestRotate {
    public static void main(String... args) {

        Rectangle r = new Rectangle(50, 50, 100, 100);
        Point check = new Point(100, 151); // clearly outside

        System.out.println("first: " + r.contains(check));

        AffineTransform at = AffineTransform.getRotateInstance(
                Math.PI/4, r.getCenterX(), r.getCenterY());

        Polygon p = new Polygon(); 

        PathIterator i = r.getPathIterator(at);
        while (!i.isDone()) {
            double[] xy = new double[2];
            i.currentSegment(xy);
            p.addPoint((int) xy[0], (int) xy[1]);
            System.out.println(Arrays.toString(xy));

            i.next();
        }

        // should now be inside :)
        System.out.println("second: " + p.contains(check));
    }
}

You can use Rectangle2D to check for containment, if instead of rotating your rectangle by an angle, say, counterclockwise, you rotate each of the points you need to check by the same angle clockwise, relative to the center of the rectangle. 你可以使用Rectangle2D来检查包容,如果不是将你的矩形旋转一个角度,比如逆时针旋转,你需要相对于矩形的中心以相同的角度旋转你需要检查的每个点。 Something like 就像是

double dx = point.x - rectangleCenter.x;
double dy = point.y - rectangleCenter.y;
double newX = rectangleCenter.x - dx*Math.cos(angle) + dy*Math.sin(angle);
double newY = rectangleCenter.x - dx*Math.sin(angle) - dy*Math.cos(angle);

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM