/** Check whether specified counter-clockwise wound convex polygons overlap. * @param p1 The first polygon. * @param p2 The second polygon. * @return Whether polygons overlap. */ public static boolean overlapConvexPolygons (Polygon p1, Polygon p2) { return overlapConvexPolygons(p1, p2, null); }
/** Check whether specified counter-clockwise wound convex polygons overlap. * @param p1 The first polygon. * @param p2 The second polygon. * @return Whether polygons overlap. */ public static boolean overlapConvexPolygons (Polygon p1, Polygon p2) { return overlapConvexPolygons(p1, p2, null); }
/** @see #overlapConvexPolygons(float[], int, int, float[], int, int, MinimumTranslationVector) */ public static boolean overlapConvexPolygons (float[] verts1, float[] verts2, MinimumTranslationVector mtv) { return overlapConvexPolygons(verts1, 0, verts1.length, verts2, 0, verts2.length, mtv); }
/** @see #overlapConvexPolygons(float[], int, int, float[], int, int, MinimumTranslationVector) */ public static boolean overlapConvexPolygons (float[] verts1, float[] verts2, MinimumTranslationVector mtv) { return overlapConvexPolygons(verts1, 0, verts1.length, verts2, 0, verts2.length, mtv); }
/** Check whether specified counter-clockwise wound convex polygons overlap. If they do, optionally obtain a Minimum * Translation Vector indicating the minimum magnitude vector required to push the polygon p1 out of collision with polygon p2. * @param p1 The first polygon. * @param p2 The second polygon. * @param mtv A Minimum Translation Vector to fill in the case of a collision, or null (optional). * @return Whether polygons overlap. */ public static boolean overlapConvexPolygons (Polygon p1, Polygon p2, MinimumTranslationVector mtv) { return overlapConvexPolygons(p1.getTransformedVertices(), p2.getTransformedVertices(), mtv); }
/** Check whether specified counter-clockwise wound convex polygons overlap. If they do, optionally obtain a Minimum * Translation Vector indicating the minimum magnitude vector required to push the polygon p1 out of collision with polygon p2. * @param p1 The first polygon. * @param p2 The second polygon. * @param mtv A Minimum Translation Vector to fill in the case of a collision, or null (optional). * @return Whether polygons overlap. */ public static boolean overlapConvexPolygons (Polygon p1, Polygon p2, MinimumTranslationVector mtv) { return overlapConvexPolygons(p1.getTransformedVertices(), p2.getTransformedVertices(), mtv); }
/** Check whether specified counter-clockwise wound convex polygons overlap. * @param p1 The first polygon. * @param p2 The second polygon. * @return Whether polygons overlap. */ public static boolean overlapConvexPolygons (Polygon p1, Polygon p2) { return overlapConvexPolygons(p1, p2, null); }
/** @see #overlapConvexPolygons(float[], int, int, float[], int, int, MinimumTranslationVector) */ public static boolean overlapConvexPolygons (float[] verts1, float[] verts2, MinimumTranslationVector mtv) { return overlapConvexPolygons(verts1, 0, verts1.length, verts2, 0, verts2.length, mtv); }
/** Check whether specified counter-clockwise wound convex polygons overlap. If they do, optionally obtain a Minimum * Translation Vector indicating the minimum magnitude vector required to push the polygon p1 out of collision with polygon p2. * @param p1 The first polygon. * @param p2 The second polygon. * @param mtv A Minimum Translation Vector to fill in the case of a collision, or null (optional). * @return Whether polygons overlap. */ public static boolean overlapConvexPolygons (Polygon p1, Polygon p2, MinimumTranslationVector mtv) { return overlapConvexPolygons(p1.getTransformedVertices(), p2.getTransformedVertices(), mtv); }