m

youxiw2000
1 parent 3e396c1e
Showing 4 changed files with 253 additions and 17 deletions
trash-garbage/src/main/java/com/trash/garbage/service/impl/GarOrderAssociationServiceAsync.java
trash-garbage/src/main/java/com/trash/garbage/utils/DistanceUtil.java
trash-garbage/src/main/java/com/trash/garbage/utils/Point.java
trash-garbage/src/main/java/com/trash/garbage/utils/VectorUtil.java
 package com.trash.garbage.service.impl;
+import java.util.ArrayList;
+import java.util.List;
+
+import org.slf4j.Logger;
+import org.slf4j.LoggerFactory;
+import org.springframework.beans.factory.annotation.Autowired;
+import org.springframework.scheduling.annotation.Async;
+import org.springframework.scheduling.annotation.EnableAsync;
+import org.springframework.stereotype.Component;
+
 import com.alibaba.fastjson.JSON;
-import com.alibaba.fastjson.JSONArray;
 import com.alibaba.fastjson.JSONObject;
-import com.trash.common.utils.DateUtils;
 import com.trash.common.utils.RemoteServerUtils;
-import com.trash.dropPointInfo.domain.DropPointInfo;
 import com.trash.dropPointInfo.service.IDropPointInfoService;
-import com.trash.dropPointInfo.service.impl.DropPointInfoServiceImpl;
 import com.trash.garbage.pojo.domain.GarOrder;
 import com.trash.garbage.pojo.domain.GarOrderMatchAsk;
 import com.trash.garbage.pojo.dto.AskTransportDto;
 import com.trash.garbage.pojo.dto.UploadDto;
 import com.trash.garbage.service.GarOrderMatchAskService;
-import com.trash.garbage.utils.HttpUtil;
-import lombok.extern.slf4j.Slf4j;
-import org.slf4j.Logger;
-import org.slf4j.LoggerFactory;
-import org.springframework.beans.factory.annotation.Autowired;
-import org.springframework.scheduling.annotation.Async;
-import org.springframework.scheduling.annotation.EnableAsync;
-import org.springframework.stereotype.Component;
-
-import java.util.ArrayList;
-import java.util.Date;
-import java.util.List;
 /**
  * 电子联单服务
@@ -106,7 +100,9 @@ public class GarOrderAssociationServiceAsync {
             garOrderMatchAsk.setUnloadingLonLat(dto.getLongitude()+","+dto.getLatitude());
             // 获取处置场所的经纬度列表
             List<double[]> coordinates = parseCoordinates(coord);
-
+            
+            
+            coordinates = com.trash.garbage.utils.DistanceUtil.expansion(coordinates, 200);
             // 判断是否在多边形内
             boolean isInside = isPointInPolygon(vehicleLat, vehicleLon, coordinates);
             if (isInside) {
+package com.trash.garbage.utils;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.LinkedList;
+import java.util.List;
+
+public class DistanceUtil {
+	 /**
+     * 操作多边形扩张/收缩
+     *
+     * @param points 待扩/收缩张多边形
+     * @param dist   距离 正数扩张，负数收缩
+     * @return 扩张/收缩后的多边形
+     */
+    public static List<double[]> expansion(List<double[]> pts, int dist) {
+        if (pts.size() <= 3) {
+        	 return pts;
+        }
+        
+        List<Point> points = new ArrayList<Point>();
+        
+        for(double[] pt:pts){
+        	Point p = new Point();
+        	p.setLat(pt[0]);
+        	p.setLng(pt[1]);
+        }
+        
+        
+        
+        List<Point> npList = new LinkedList<>();
+        List<Double> lngList = new LinkedList<>();
+        List<Double> latList = new LinkedList<>();
+
+        for (Point point : points) {
+            lngList.add(point.getLng());
+            latList.add(point.getLat());
+        }
+        Double minLng = Collections.min(lngList);
+        Double minLat = Collections.min(latList);
+
+        for (Point point : points) {
+            Point p = new Point();
+            p.setLng(point.getLng() - minLng);
+            p.setLat(point.getLat() - minLat);
+            npList.add(p);
+        }
+
+        List<Point> list = enlarge(npList, dist);
+        LinkedList<Point> resultList = new LinkedList<>();
+        for (Point point : list) {
+            Point np = new Point();
+            np.setLng(point.getLng() + minLng);
+            np.setLat(point.getLat() + minLat);
+            resultList.add(np);
+        }
+        
+        List<double[]> result = new ArrayList<double[]>();
+        
+        for(Point np:resultList){
+        	double[] d = {np.getLat(),np.getLng()};
+        	result.add(d);
+        }
+        
+        return result;
+    }
+
+    /**
+     * 多边形外扩/收缩
+     */
+    private static List<Point> enlarge(List<Point> points, int dist) {
+        LinkedList<Point> resultList = new LinkedList<>();
+        int size = points.size();
+        double angle = dist * dmi();
+        angle = isConvex(points) ? angle : -angle;
+
+        for (int i = 0; i < size; i++) {
+            Point pi = points.get(i);
+            Point v1 = VectorUtil.sub(points.get((i - 1 + size) % size), pi);
+            Point v2 = VectorUtil.sub(points.get((i + 1) % size), pi);
+            double norm1 = VectorUtil.norm(v1);
+            double norm2 = VectorUtil.norm(v2);
+
+            if (norm1 <= 0 || norm2 <= 0) {
+                // 剔除重复点（或距离极近的点）
+                points.remove(i);
+                return enlarge(points, dist);
+            }
+
+            Point normalizeV1 = VectorUtil.mul(v1, 1 / norm1);
+            Point normalizeV2 = VectorUtil.mul(v2, 1 / norm2);
+            double sinTheta = VectorUtil.cross(normalizeV1, normalizeV2);
+            Point qi = VectorUtil.add(pi, VectorUtil.mul(VectorUtil.add(normalizeV1, normalizeV2), angle / sinTheta));
+            resultList.add(qi);
+        }
+
+        return resultList;
+    }
+
+    /**
+     * 计算1米代表的角度 这里只是近似计算，事实上随着纬度的变化其变动范围将受到影响
+     */
+    private static double dmi() {
+    	
+//        double s = 6378.137 * 1000;
+//        return 1 / (Math.PI / 180 * s);
+    	return 0.000009;
+    }
+
+    /**
+     * 判断是否凸多边形
+     */
+    private static boolean isConvex(List<Point> points) {
+        double area = 0;
+        Point p1 = VectorUtil.sub(points.get(1), points.get(0));
+        Point p2;
+        for (int i = 2; i < points.size(); i++) {
+            p2 = VectorUtil.sub(points.get(i), points.get(0));
+            area += VectorUtil.cross(p1, p2);
+            p1 = p2;
+        }
+        return area > 0;
+    }
+
+    /**
+     * 多边形周长
+     */
+    private static double perimeter(List<Point> points) {
+        int size = points.size();
+        double perimeter = 0.0d;
+        Point point;
+        for (int i = 0; i < size; i++) {
+            point = points.get(i);
+            perimeter += VectorUtil.norm(VectorUtil.sub(points.get((i - 1 + size) % size), point));
+        }
+        return perimeter;
+    }
+}
+package com.trash.garbage.utils;
+
+import java.awt.geom.Point2D;
+
+public class Point {
+    private double lat;
+    private double lng;
+
+
+	public Point() {
+    }
+
+
+    public Point(String lng, String lat) {
+        this.lng = Double.parseDouble(lng);
+        this.lat = Double.parseDouble(lat);
+    }
+
+    public Point(double lng, double lat) {
+        this.lng = lng;
+        this.lat = lat;
+    }
+
+    @Override
+    public boolean equals(Object obj) {
+        if (obj instanceof Point) {
+        	Point bmapPoint = (Point) obj;
+            return bmapPoint.getLng()==lng && bmapPoint.getLat() == lat;
+        } else {
+            return false;
+        }
+    }
+
+    public double getLat() {
+        return lat;
+    }
+    public void setLat(double lat) {
+        this.lat = lat;
+    }
+    public double getLng() {
+        return lng;
+    }
+    public void setLng(double lng) {
+        this.lng = lng;
+    }
+    
+    public Point2D.Double getPoint2D(){
+    	  return new Point2D.Double(getLng(),getLat());
+    }
+    
+
+    @Override
+    public String toString() {
+        return getLng()+","+getLat();
+    }
+}
+package com.trash.garbage.utils;
+public class VectorUtil {
+	 /**
+     * 向量求模数
+     */
+    public static double norm(Point point) {
+        return Math.sqrt(point.getLng() * point.getLng() + point.getLat() * point.getLat());
+    }
+
+    /**
+     * 向量加法
+     */
+    public static Point add(Point point1, Point point2) {
+        Point point = new Point();
+        point.setLng(point1.getLng() + point2.getLng());
+        point.setLat(point1.getLat() + point2.getLat());
+        return point;
+    }
+
+    /**
+     * 向量减法
+     */
+    public static Point sub(Point point1, Point point2) {
+        Point point = new Point();
+        point.setLng(point1.getLng() - point2.getLng());
+        point.setLat(point1.getLat() - point2.getLat());
+        return point;
+    }
+
+    /**
+     * 向量乘法
+     */
+    public static Point mul(Point p, double d) {
+        Point point = new Point();
+        point.setLng(p.getLng() * d);
+        point.setLat(p.getLat() * d);
+        return point;
+    }
+
+    /**
+     * 向量叉乘
+     */
+    public static double cross(Point p1, Point p2) {
+        return p1.getLng() * p2.getLat() - p1.getLat() * p2.getLng();
+    }
+}