java求某点坐标是否包含在菱形面积中

package com.bootdo.common.utils;

import com.alibaba.fastjson.JSONArray;
import com.alibaba.fastjson.JSONObject;

import java.awt.geom.Point2D;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;

//计算点是否在面积内的工具类
public class AreaUtils {
    //计算一个点是否在多边形内
    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 ray left point
            }

            if(p.x > Math.min(p1.x, p2.x) && p.x < Math.max(p1.x, p2.x)){//ray is crossing over by the algorithm (common part of)
                if(p.y <= Math.max(p1.y, p2.y)){//x is before of ray
                    if(p1.x == p2.x && p.y >= Math.min(p1.y, p2.y)){//overlies on a horizontal ray
                        return boundOrVertex;
                    }

                    if(p1.y == p2.y){//ray is vertical
                        if(p1.y == p.y){//overlies on a vertical ray
                            return boundOrVertex;
                        }else{//before ray
                            ++intersectCount;
                        }
                    }else{//cross point on the left side
                        double xinters = (p.x - p1.x) * (p2.y - p1.y) / (p2.x - p1.x) + p1.y;//cross point of y
                        if(Math.abs(p.y - xinters) < precision){//overlies on a ray
                            return boundOrVertex;
                        }

                        if(p.y < xinters){//before ray
                            ++intersectCount;
                        }
                    }
                }
            }else{//special case when ray is crossing through the vertex
                if(p.x == p2.x && p.y <= p2.y){//p crossing over p2
                    Point2D.Double p3 = pts.get((i+1) % N); //next vertex
                    if(p.x >= Math.min(p1.x, p3.x) && p.x <= Math.max(p1.x, p3.x)){//p.x lies between p1.x & p3.x
                        ++intersectCount;
                    }else{
                        intersectCount += 2;
                    }
                }
            }
            p1 = p2;//next ray left point
        }

        if(intersectCount % 2 == 0){//偶数在多边形外
            return false;
        } else { //奇数在多边形内
            return true;
        }

    }
       //geX,geY为点的坐标 jsonArray 为菱形的每个点
    public static   Boolean testMain(String geX, String geY, JSONArray jsonArray) {

        Point2D.Double point = new Point2D.Double(Double.valueOf(geX), Double.valueOf(geY));

        List<Point2D.Double> pts = new ArrayList<Point2D.Double>();
        if(jsonArray.size() >0){
            for(int i=0;i<jsonArray.size();i++){
              String s=  jsonArray.get(i).toString();
                Object object = JSONObject.parse(s);
                Map entry = (Map)object;
                String x= entry.get("x").toString();
                String y= entry.get("y").toString();
                pts.add(new Point2D.Double(Double.valueOf(x), Double.valueOf(y)));
            }
        }
       /* pts.add(new Point2D.Double(116.395, 39.910));
        pts.add(new Point2D.Double(116.394, 39.914));
        pts.add(new Point2D.Double(116.403, 39.920));
        pts.add(new Point2D.Double(116.402, 39.914));
        pts.add(new Point2D.Double(116.410, 39.913));*/

        Boolean flag= AreaUtils.IsPtInPoly(point, pts);
        if (flag) {
       /*     System.out.println("点在多边形内");*/
            return flag;
        } else {
          /*  System.out.println("点在多边形外");*/
            return flag;
        }
    }

}

其中 geX,geY,jsonArray对象是每个点的坐标 根据自己实际类型进行修改

  • 1
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值