Say that Intersection.testPolygonPolygon only works for convex polygons

src/org/joml/Intersectiond.java

@@ -4762,13 +4762,13 @@ private static boolean separatingAxis(Vector2d[] v1s, Vector2d[] v2s, double aX,
     }
 
     /**
-     * Test if the two polygons, given via their vertices, intersect.
+     * Test if the two convex polygons, given via their vertices, intersect.
      * 
      * @param v1s
-     *          the vertices of the first polygon
+     *          the vertices of the first convex polygon
      * @param v2s
-     *          the vertices of the second polygon
-     * @return <code>true</code> if the polygons intersect; <code>false</code> otherwise
+     *          the vertices of the second convex polygon
+     * @return <code>true</code> if the convex polygons intersect; <code>false</code> otherwise
      */
     public static boolean testPolygonPolygon(Vector2d[] v1s, Vector2d[] v2s) {
         /* Try to find a separating axis using the first polygon's edges */

src/org/joml/Intersectionf.java

@@ -4762,13 +4762,13 @@ private static boolean separatingAxis(Vector2f[] v1s, Vector2f[] v2s, float aX,
     }
 
     /**
-     * Test if the two polygons, given via their vertices, intersect.
+     * Test if the two convex polygons, given via their vertices, intersect.
      * 
      * @param v1s
-     *          the vertices of the first polygon
+     *          the vertices of the first convex polygon
      * @param v2s
-     *          the vertices of the second polygon
-     * @return <code>true</code> if the polygons intersect; <code>false</code> otherwise
+     *          the vertices of the second convex polygon
+     * @return <code>true</code> if the convex polygons intersect; <code>false</code> otherwise
      */
     public static boolean testPolygonPolygon(Vector2f[] v1s, Vector2f[] v2s) {
         /* Try to find a separating axis using the first polygon's edges */