一个点是否在一个有效区域内

21 阅读2分钟

pom文件

<dependency>
    <groupId>io.leonard</groupId>
    <artifactId>google-polyline-codec</artifactId>
    <version>0.0.2</version>
</dependency>

实例代码:

// 这里进度写死6
List<Position> positionList = PolylineUtils.decode(geoPointers, 6);

工具类

@Data
@AllArgsConstructor
public class Area {
    // 精度
    private Double px;
    // 纬度
    private Double py;
}
package com.alipay.sportshealth.biz.access.event;/**
 * @program: sportshealth
 * @description:
 * @author: guo-coffee
 * @create: 2023-09-08
 **/
import java.util.ArrayList;

/**
 *@program: sportshealth
 *@description:
 *@author: guo-coffee
 *@create: 2023-09-08
 **/
public class Point {

    /**
     *  是否有 横断<br/>
     *  参数为四个点的坐标
     */
    public boolean isIntersect ( double px1 , double py1 , double px2 , double py2 , double px3 , double py3 , double px4 ,
                                 double py4 )
    {
        boolean flag = false;
        double d = (px2 - px1) * (py4 - py3) - (py2 - py1) * (px4 - px3);
        if ( d != 0 )
        {
            double r = ((py1 - py3) * (px4 - px3) - (px1 - px3) * (py4 - py3)) / d;
            double s = ((py1 - py3) * (px2 - px1) - (px1 - px3) * (py2 - py1)) / d;
            if ( (r >= 0) && (r <= 1) && (s >= 0) && (s <= 1) )
            {
                flag = true;
            }
        }
        return flag;
    }

    /**
     *  目标点是否在目标边上边上<br/>
     *
     * @param px0 目标点的经度坐标
     * @param py0 目标点的纬度坐标
     * @param px1 目标线的起点(终点)经度坐标
     * @param py1 目标线的起点(终点)纬度坐标
     * @param px2 目标线的终点(起点)经度坐标
     * @param py2 目标线的终点(起点)纬度坐标
     */
    public boolean isPointOnLine ( double px0 , double py0 , double px1 , double py1 , double px2 , double py2 )
    {
        boolean flag = false;
        double ESP = 1e-9;//无限小的正数
        if ( (Math.abs(Multiply(px0, py0, px1, py1, px2, py2)) < ESP) && ((px0 - px1) * (px0 - px2) <= 0)
                && ((py0 - py1) * (py0 - py2) <= 0) )
        {
            flag = true;
        }
        return flag;
    }

    public double Multiply ( double px0 , double py0 , double px1 , double py1 , double px2 , double py2 )
    {
        return ((px1 - px0) * (py2 - py0) - (px2 - px0) * (py1 - py0));
    }


    /**
     * 判断目标点是否在多边形内(由多个点组成)<br/>
     *
     * @param px 目标点的经度坐标
     * @param py 目标点的纬度坐标
     * @param polygonXA 多边形的经度坐标集合
     * @param polygonYA 多边形的纬度坐标集合
     * @return
     */
    public boolean isPointInPolygon (double px , double py , ArrayList<Double> polygonXA , ArrayList<Double> polygonYA )
    {
        boolean isInside = false;
        double ESP = 1e-9;
        int count = 0;
        double linePoint1x;
        double linePoint1y;
        double linePoint2x = 180;
        double linePoint2y;

        linePoint1x = px;
        linePoint1y = py;
        linePoint2y = py;
        for (int i = 0; i < polygonXA.size() - 1; i++)
        {
            double cx1 = polygonXA.get(i);
            double cy1 = polygonYA.get(i);
            double cx2 = polygonXA.get(i + 1);
            double cy2 = polygonYA.get(i + 1);
            //如果目标点在任何一条线上
            if ( isPointOnLine(px, py, cx1, cy1, cx2, cy2) )
            {
                return true;
            }
            //如果线段的长度无限小(趋于零)那么这两点实际是重合的,不足以构成一条线段
            if ( Math.abs(cy2 - cy1) < ESP )
            {
                continue;
            }
            //第一个点是否在以目标点为基础衍生的平行纬度线
            if ( isPointOnLine(cx1, cy1, linePoint1x, linePoint1y, linePoint2x, linePoint2y) )
            {
                //第二个点在第一个的下方,靠近赤道纬度为零(最小纬度)
                if ( cy1 > cy2 )
                    count++;
            }
            //第二个点是否在以目标点为基础衍生的平行纬度线
            else if ( isPointOnLine(cx2, cy2, linePoint1x, linePoint1y, linePoint2x, linePoint2y) )
            {
                //第二个点在第一个的上方,靠近极点(南极或北极)纬度为90(最大纬度)
                if ( cy2 > cy1 )
                    count++;
            }
            //由两点组成的线段是否和以目标点为基础衍生的平行纬度线相交
            else if ( isIntersect(cx1, cy1, cx2, cy2, linePoint1x, linePoint1y, linePoint2x, linePoint2y) )
            {
                count++;
            }
        }
        if ( count % 2 == 1 )
        {
            isInside = true;
        }

        return isInside;
    }
}

测试类

package com.alipay.sportshealth.biz.access.event;

import com.alibaba.fastjson.JSON;
import io.leonard.PolylineUtils;
import io.leonard.Position;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * @program: sportshealth
 * @description:
 * @author: guo-coffee
 * @create: 2023-09-07
 **/
public class SunshineRun {
    /**
     * 精度集合
     */
    private static final ArrayList<Double> polygonXA = new ArrayList<>();
    /**
     * 纬度集合
     */
    private static final ArrayList<Double> polygonYA = new ArrayList<>();

    /**
     * 此路线有6个点从故宫南门(不再规划范围内)-故宫博物馆-御花园-坤宁宫-乾清宫-灯市口小学(不再规划范围内)
     */
    private static final List<String> route = Arrays.asList("116.396804,39.923431"
            ,"116.396793,39.922296","116.396814,39.921432","116.396889,39.920815"
            ,"116.396922,39.920173","116.403332,39.919362");
    /**
     * 有效区域绘制
     */
    private static final List<Area> selectedArea = Arrays.asList(new Area(116.392195, 39.922419),
            new Area(116.401428, 39.92277), new Area(116.401841, 39.913776),
            new Area(116.392619, 39.913409));

    public static void main(String[] args) {
        // 1、模拟路径
        List<Position> path = createRoute();
        // 2、模拟结束运动转化为路径
        String geoPointers = PolylineUtils.encode(path, 6);
        System.out.println("模拟运动路线"+geoPointers);
        // 3、运动路径转化为坐标
        List<Position> positionList = PolylineUtils.decode(geoPointers, 6);
        System.out.println("positionList"+JSON.toJSONString(positionList));
        selectedArea.forEach(area -> {polygonXA.add(area.getPx());polygonYA.add(area.getPy());});
        // 4、坐标是否在有效区
        int count = 0;
        Point point=new Point();
        for (Position position : positionList) {
            if(point.isPointInPolygon(position.getLongitude(),position.getLatitude(),polygonXA,polygonYA)){
                count++;
            }
        }
        // 获取路径百分比
        if(0 == count){
            System.out.println("该用户路线在有效范围占比"+count+"%");
        }else {
            String passRatio = String.format("%.2f",( Double.parseDouble(count+"") / Double.parseDouble(path.size()+"") )*100);
            System.out.println("该用户路线在有效范围占比"+passRatio+"%");
        }
    }

    /**
     * 创建用户的坐标点
     * @return 用户产生的坐标点集合
     */
    private static List<Position> createRoute(){
        List<Position> positionList = new ArrayList<>();
        for (String path : route) {
            String[] split = path.split(",");
            Position position = Position.fromLngLat(Double.parseDouble(split[0]),Double.parseDouble(split[1]));
            positionList.add(position);
        }
       return positionList;
    }
}