Java电子围栏计算

 /**
	* 地球半径(米)
	*/
	private static final double EARTH_RADIUS = 6378137.0;
	
	private static double rad(double d) {
	   return d * Math.PI / 180.0;
	}


	 /**
	  * 计算是否在圆内
	  * @param radius 半径（单位/米）
	  * @param p1 圆心坐标
	  * @param p2 判断点坐标
	  * @return: boolean true:在圆内,false:在圆外
	  */
	 public static boolean isInCircle(double radius, Point p1, Point p2) {
	     double radLat1 = rad(p1.getLat());
	     double radLat2 = rad(p2.getLat());
	     double a = radLat1 - radLat2;
	     double b = rad(p1.getLng()) - rad(p2.getLng());
	     double s = 2 * Math.asin(Math.sqrt(Math.pow(Math.sin(a / 2), 2) +
	             Math.cos(radLat1) * Math.cos(radLat2) * Math.pow(Math.sin(b / 2), 2)));
	     s = s * EARTH_RADIUS;
	     s = Math.round(s * 10000) / 10000;
	     return !(s > radius);
	 }

 /**
     * 判断点是否在多边形内
     * @param point 测试点
     * @param pts   多边形的点
     * @return boolean true:在多边形内, false:在多边形外
     * @throws
     * @Title: IsPointInPoly
     */
    public static boolean isInPolygon(Point point, List<Point> pts) {

        int N = pts.size();
        boolean boundOrVertex = true;
        //交叉点数量
        int intersectCount = 0;
        //浮点类型计算时候与0比较时候的容差
        double precision = 2e-10;
        //临近顶点
        Point p1, p2;
        //当前点
        Point p = point;

        p1 = pts.get(0);
        for (int i = 1; i <= N; ++i) {
            if (p.equals(p1)) {
                return boundOrVertex;
            }

            p2 = pts.get(i % N);
            if (p.getLng() < Math.min(p1.getLng(), p2.getLng()) || p.getLng() > Math.max(p1.getLng(), p2.getLng())) {
                p1 = p2;
                continue;
            }

            //射线穿过算法
            if (p.getLng() > Math.min(p1.getLng(), p2.getLng()) && p.getLng() < Math.max(p1.getLng(), p2.getLng())) {
                if (p.getLat() <= Math.max(p1.getLat(), p2.getLat())) {
                    if (p1.getLng() == p2.getLng() && p.getLat() >= Math.min(p1.getLat(), p2.getLat())) {
                        return boundOrVertex;
                    }

                    if (p1.getLat() == p2.getLat()) {
                        if (p1.getLat() == p.getLat()) {
                            return boundOrVertex;
                        } else {
                            ++intersectCount;
                        }
                    } else {
                        double xinters = (p.getLng() - p1.getLng()) * (p2.getLat() - p1.getLat()) / (p2.getLng() - p1.getLng()) + p1.getLat();
                        if (Math.abs(p.getLat() - xinters) < precision) {
                            return boundOrVertex;
                        }

                        if (p.getLat() < xinters) {
                            ++intersectCount;
                        }
                    }
                }
            } else {
                if (p.getLng() == p2.getLng() && p.getLat() <= p2.getLat()) {
                    Point p3 = pts.get((i + 1) % N);
                    if (p.getLng() >= Math.min(p1.getLng(), p3.getLng()) && p.getLng() <= Math.max(p1.getLng(), p3.getLng())) {
                        ++intersectCount;
                    } else {
                        intersectCount += 2;
                    }
                }
            }
            p1 = p2;
        }
        return intersectCount % 2 != 0;
    }	


 public static void main(String[] args) throws Exception {
        Point p1 = new Point(118.782045,31.988435);

        List<Point> pts = new ArrayList<>();
        Point p2 = new Point(118.77627121601854,31.996274741446197);
        Point p3 = new Point(118.77727731818972,31.982554666038734);
        Point p4 = new Point(118.80142377029793,31.991864943190176);
        pts.add(p2);
        pts.add(p3);
        pts.add(p4);
        boolean inPolygon = isInPolygon(p1, pts);
        System.out.println(inPolygon);
    }

	```