java 矩形旋转_在Java中旋转矩形

旋转你要测试的所有点,并使用Recthai2D的contains(Point)方法作为Mihai.

但是如果你真的想要旋转矩形,你可以这样做(这是整数版本,但可能你可以用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));

}

}