import java.awt.geom.Point2D;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.UnsupportedEncodingException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import com.alibaba.fastjson.JSON;
import com.alibaba.fastjson.JSONArray;
import com.alibaba.fastjson.JSONObject;
/**
*
* @ClassName: OrderMapTest
* @Description: (根据经纬度判断是否在特定区域内)
* @author
*/
public class OrderMapTest {
public static void main(String[] args) {
String fileName = "D:\\root\\lqyq.txt";
String str = readFileContent(fileName);
JSONObject jsonObject = JSONObject.parseObject(str);
JSONObject jsonObject2 = jsonObject.getJSONObject("geometry");
JSONArray jsonArray = jsonObject2.getJSONArray("coordinates");
String partitionLocation ="";
for (int i = 0; i < jsonArray.size(); i++) {
JSONArray jsonArray2 = jsonArray.getJSONArray(i);
for (int j = 0; j < jsonArray2.size(); j++) {
JSONArray jsonArray3 = jsonArray2.getJSONArray(i);
for (int x = 0; x < jsonArray3.size(); x++) {
jsonArray3.getJSONArray(x).get(0);
partitionLocation += jsonArray3.getJSONArray(x).get(0)+"_"+jsonArray3.getJSONArray(x).get(1);
partitionLocation += ",";
}
}
}
String fileName1 = "D:\\root\\jzw.txt";
String str1 = readFileContent(fileName1);
JSONObject jsonObject1 = JSONObject.parseObject(str1);
JSONArray jsonArray2 = jsonObject1.getJSONArray("features");
JSONObject obj=new JSONObject();//创建JSONObject对象
obj.put("type", "FeatureCollection");
Map<String, String> orderLocation = new HashMap<String, String>();
List<Object> list = new ArrayList<>();
for (int i = 0; i < jsonArray2.size(); i++) {
JSONObject object = ((JSONObject) jsonArray2.get(i)).getJSONObject("geometry");
JSONArray jsonArray1 = object.getJSONArray("coordinates");
List<Object> objectjzw = (List<Object>) ((List<Object>) jsonArray1.get(0)).get(0);
//被检测的经纬度点
orderLocation.put("X", objectjzw.get(0).toString());
orderLocation.put("Y", objectjzw.get(1).toString());
boolean inPolygon = isInPolygon(orderLocation, partitionLocation);
if(inPolygon){
JSONObject obj1=new JSONObject();//创建JSONObject对象
obj1.put("type", ((JSONObject) jsonArray2.get(i)).get("type"));
obj1.put("properties", ((JSONObject) jsonArray2.get(i)).getJSONObject("properties"));
obj1.put("geometry", object);
list.add(obj1);
}
}
obj.put("features",list);
OutputStreamWriter osw;
try {
osw = new OutputStreamWriter(new FileOutputStream("D:/test.json"),"UTF-8");
osw.write(obj.toString());
osw.flush();//清空缓冲区,强制输出数据
osw.close();//关闭输出流
} catch (UnsupportedEncodingException e) {
e.printStackTrace();
} catch (FileNotFoundException e) {
e.printStackTrace();
} catch (IOException e) {
e.printStackTrace();
}
}
public static String readFileContent(String fileName) {
File file = new File(fileName);
BufferedReader reader = null;
StringBuffer sbf = new StringBuffer();
try {
reader = new BufferedReader(new FileReader(file));
String tempStr;
while ((tempStr = reader.readLine()) != null) {
sbf.append(tempStr);
}
reader.close();
return sbf.toString();
} catch (IOException e) {
e.printStackTrace();
} finally {
if (reader != null) {
try {
reader.close();
} catch (IOException e1) {
e1.printStackTrace();
}
}
}
return sbf.toString();
}
/**
* 判断当前位置是否在多边形区域内
* @param orderLocation 当前点
* @param partitionLocation 区域顶点
* @return
*/
public static boolean isInPolygon(Map<String, String> orderLocation,String partitionLocation){
double p_x =Double.parseDouble(orderLocation.get("X"));
double p_y =Double.parseDouble(orderLocation.get("Y"));
Point2D.Double point = new Point2D.Double(p_x, p_y);
List<Point2D.Double> pointList= new ArrayList<Point2D.Double>();
String[] strList = partitionLocation.split(",");
for (String str : strList){
String[] points = str.split("_");
double polygonPoint_x=Double.parseDouble(points[0]);
double polygonPoint_y=Double.parseDouble(points[1]);
Point2D.Double polygonPoint = new Point2D.Double(polygonPoint_x,polygonPoint_y);
pointList.add(polygonPoint);
}
return IsPtInPoly(point,pointList);
}
/**
* 返回一个点是否在一个多边形区域内, 如果点位于多边形的顶点或边上,不算做点在多边形内,返回false
* @param point
* @param polygon
* @return
*/
public static boolean checkWithJdkGeneralPath(Point2D.Double point, List<Point2D.Double> polygon) {
java.awt.geom.GeneralPath p = new java.awt.geom.GeneralPath();
Point2D.Double first = polygon.get(0);
p.moveTo(first.x, first.y);
polygon.remove(0);
for (Point2D.Double d : polygon) {
p.lineTo(d.x, d.y);
}
p.lineTo(first.x, first.y);
p.closePath();
return p.contains(point);
}
/**
* 判断点是否在多边形内,如果点位于多边形的顶点或边上,也算做点在多边形内,直接返回true
* @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 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;
}
}
}