import org.andengine.opengl.util.VertexUtils; //导入依赖的package包/类
/**
 * @param pVerticesA
 * @param pVertexCountA the number of vertices in pVerticesA
 * @param pVertexOffsetXA
 * @param pVertexOffsetYA
 * @param pVertexStrideA
 * @param pVerticesB
 * @param pVertexCountB the number of vertices in pVerticesB
 * @param pVertexOffsetXB
 * @param pVertexOffsetYB
 * @param pVertexStrideB
 * @return
 */
public static boolean checkCollision(final float[] pVerticesA, final int pVertexCountA, final int pVertexOffsetXA, final int pVertexOffsetYA, final int pVertexStrideA, final float[] pVerticesB, final int pVertexCountB, final int pVertexOffsetXB, final int pVertexOffsetYB, final int pVertexStrideB) {
	/* Check all the lines of A ... */
	for (int a = pVertexCountA - 2; a >= 0; a--) {
		/* ... against all lines in B. */
		if (BaseCollisionChecker.checkCollisionSub(pVerticesA, pVertexOffsetXA, pVertexOffsetYA, pVertexStrideA, a, a + 1, pVerticesB, pVertexCountB, pVertexOffsetXB, pVertexOffsetYB, pVertexStrideB)) {
			return true;
		}
	}
	/* Also check the 'around the corner of the array' line of A against all lines in B. */
	if (BaseCollisionChecker.checkCollisionSub(pVerticesA, pVertexOffsetXA, pVertexOffsetYA, pVertexStrideA, pVertexCountA - 1, 0, pVerticesB, pVertexCountB, pVertexOffsetXB, pVertexOffsetYB, pVertexStrideB)) {
		return true;
	} else {
		/* At last check if one polygon 'contains' the other one by checking
		 * if one vertex of the one vertices is contained by all of the other vertices. */
		if (BaseCollisionChecker.checkContains(pVerticesA, pVertexCountA, VertexUtils.getVertex(pVerticesB, pVertexOffsetXB, pVertexStrideB, 0), VertexUtils.getVertex(pVerticesB, pVertexOffsetYB, pVertexStrideB, 0))) {
			return true;
		} else if (BaseCollisionChecker.checkContains(pVerticesB, pVertexCountB, VertexUtils.getVertex(pVerticesA, pVertexOffsetXA, pVertexStrideA, 0), VertexUtils.getVertex(pVerticesA, pVertexOffsetYA, pVertexStrideA, 0))) {
			return true;
		} else {
			return false;
		}
	}
}
 

import org.andengine.opengl.util.VertexUtils; //导入依赖的package包/类
/**
 * Works with complex polygons!
 *
 * @see <a href="http://alienryderflex.com/polygon/">alienryderflex.com/polygon/</a>
 *
 * @param pVertices
 * @param pVertexCount the number of vertices in pVertices
 * @param pVertexOffsetX
 * @param pVertexOffsetY
 * @param pVertexStride
 * @param pX
 * @param pY
 * @return <code>true</code> when the point defined by <code>(pX, pY)</code> is inside the polygon defined by <code>pVertices</code>, <code>false</code>. If the point is exactly on the edge of the polygon, the result can be <code>true</code> or <code>false</code>.
 */
public static boolean checkContains(final float[] pVertices, final int pVertexCount, final int pVertexOffsetX, final int pVertexOffsetY, final int pVertexStride, final float pX, final float pY) {
	boolean odd = false;

	int j = pVertexCount - 1;
	for (int i = 0; i < pVertexCount; i++) {
		final float vertexXI = VertexUtils.getVertex(pVertices, pVertexOffsetX, pVertexStride, i);
		final float vertexYI = VertexUtils.getVertex(pVertices, pVertexOffsetY, pVertexStride, i);
		final float vertexXJ = VertexUtils.getVertex(pVertices, pVertexOffsetX, pVertexStride, j);
		final float vertexYJ = VertexUtils.getVertex(pVertices, pVertexOffsetY, pVertexStride, j);

		if ((((vertexYI < pY) && (vertexYJ >= pY)) || ((vertexYJ < pY) && (vertexYI >= pY))) && ((vertexXI <= pX) || (vertexXJ <= pX))) {
			odd ^= ((vertexXI + (((pY - vertexYI) / (vertexYJ - vertexYI)) * (vertexXJ - vertexXI))) < pX);
		}
		j = i;
	}

	return odd;
}
 

import org.andengine.opengl.util.VertexUtils; //导入依赖的package包/类
/**
 * @param pVerticesA
 * @param pVertexCountA the number of vertices in pVerticesA
 * @param pVertexOffsetXA
 * @param pVertexOffsetYA
 * @param pVertexStrideA
 * @param pVerticesB
 * @param pVertexCountB the number of vertices in pVerticesB
 * @param pVertexOffsetXB
 * @param pVertexOffsetYB
 * @param pVertexStrideB
 * @return
 */
public static boolean checkCollision(final float[] pVerticesA, final int pVertexCountA, final int pVertexOffsetXA, final int pVertexOffsetYA, final int pVertexStrideA, final float[] pVerticesB, final int pVertexCountB, final int pVertexOffsetXB, final int pVertexOffsetYB, final int pVertexStrideB) {
	/* Check all the lines of A ... */
	for(int a = pVertexCountA - 2; a >= 0; a--) {
		/* ... against all lines in B. */
		if(ShapeCollisionChecker.checkCollisionSub(pVerticesA, pVertexOffsetXA, pVertexOffsetYA, pVertexStrideA, a, a + 1, pVerticesB, pVertexCountB, pVertexOffsetXB, pVertexOffsetYB, pVertexStrideB)){
			return true;
		}
	}
	/* Also check the 'around the corner of the array' line of A against all lines in B. */
	if(ShapeCollisionChecker.checkCollisionSub(pVerticesA, pVertexOffsetXA, pVertexOffsetYA, pVertexStrideA, pVertexCountA - 1, 0, pVerticesB, pVertexCountB, pVertexOffsetXB, pVertexOffsetYB, pVertexStrideB)){
		return true;
	} else {
		/* At last check if one polygon 'contains' the other one by checking
		 * if one vertex of the one vertices is contained by all of the other vertices. */
		if(ShapeCollisionChecker.checkContains(pVerticesA, pVertexCountA, VertexUtils.getVertex(pVerticesB, pVertexOffsetXB, pVertexStrideB, 0), VertexUtils.getVertex(pVerticesB, pVertexOffsetYB, pVertexStrideB, 0))) {
			return true;
		} else if(ShapeCollisionChecker.checkContains(pVerticesB, pVertexCountB, VertexUtils.getVertex(pVerticesA, pVertexOffsetXA, pVertexStrideA, 0), VertexUtils.getVertex(pVerticesA, pVertexOffsetYA, pVertexStrideA, 0))) {
			return true;
		} else {
			return false;
		}
	}
}
 

import org.andengine.opengl.util.VertexUtils; //导入依赖的package包/类
/**
 * Works with complex polygons!
 *
 * @see http://alienryderflex.com/polygon/
 *
 * @param pVertices
 * @param pVertexCount the number of vertices in pVertices
 * @param pVertexOffsetX
 * @param pVertexOffsetY
 * @param pVertexStride
 * @param pX
 * @param pY
 * @return <code>true</code> when the point defined by <code>(pX, pY)</code> is inside the polygon defined by <code>pVertices</code>, <code>false</code>. If the point is exactly on the edge of the polygon, the result can be <code>true</code> or <code>false</code>. 
 */
public static boolean checkContains(final float[] pVertices, final int pVertexCount, final int pVertexOffsetX, final int pVertexOffsetY, final int pVertexStride, final float pX, final float pY) {
	boolean odd = false;

	int j = pVertexCount - 1;
	for(int i = 0; i < pVertexCount; i++) {
		final float vertexXI = VertexUtils.getVertex(pVertices, pVertexOffsetX, pVertexStride, i);
		final float vertexYI = VertexUtils.getVertex(pVertices, pVertexOffsetY, pVertexStride, i);
		final float vertexXJ = VertexUtils.getVertex(pVertices, pVertexOffsetX, pVertexStride, j);
		final float vertexYJ = VertexUtils.getVertex(pVertices, pVertexOffsetY, pVertexStride, j);

		if((((vertexYI < pY) && (vertexYJ >= pY)) || ((vertexYJ < pY) && (vertexYI >= pY))) && ((vertexXI <= pX) || (vertexXJ <= pX))) {
			odd ^= ((vertexXI + (((pY - vertexYI) / (vertexYJ - vertexYI)) * (vertexXJ - vertexXI))) < pX);
		}
		j = i;
	}

	return odd;
}