判断经纬度点是否在多边形内

根据经纬度点集合，判断某个点是否在该区域内

/**
 * 判断点是否在多边形内
 *
 * @param point 检测点
 * @param pts   多边形的顶点
 * @return 点在多边形内返回true, 否则返回false
 */
public static boolean isPtInPoly(Point2D.Double point, List<Point2D.Double> pts) {

    int N = pts.size();
    boolean boundOrVertex = true; //如果点位于多边形的顶点或边上，也算做点在多边形内，直接返回true
    int intersectCount = 0;//cross points count of x
    double precision = 2e-10; //浮点类型计算时候与0比较时候的容差
    Point2D.Double p1, p2;//neighbour bound vertices
    Point2D.Double p = point; //当前点

    p1 = pts.get(0);//left vertex
    for (int i = 1; i <= N; ++i) {//check all rays
        if (p.equals(p1)) {
            return boundOrVertex;//p is an vertex
        }
        p2 = pts.get(i % N);//right vertex
        if (p.x < Math.min(p1.x, p2.x) || p.x > Math.max(p1.x, p2.x)) {//ray is outside of our interests
            p1 = p2;
            continue;//next ra