java验证两条经纬度的线在地图上有没有相交

java验证两条经纬度的线在地图上有没有相交

package com.cm.gis;


public class GisChenk {
   
	public static void main(String[] args) {
   
		Point p1=new Point(MillierConvertion(17.99958, 109.76837)[0],MillierConvertion(17.99958, 109.76837)[1]);
        Point p2=new Point(MillierConvertion(17.92094, 113.02671)[0],MillierConvertion(17.92094, 113.02671)[1]);
        Point p3=new Point(MillierConvertion(16.90878,109.92919)[0],MillierConvertion(16.90878,109.92919)[1]);
        Point p4=new Point(MillierConvertion(18.79359, 112.08933)[0],MillierConvertion(18.79359, 112.08933)[1]);
        System.out.println(segIntersect(p1,p2,p3,p4));
	}
	/**
	 * 将经纬度转换成X和Y轴
	 * @param lat
	 * @param lon
	 * @return
	 */
	public static double[] MillierConvertion(double lat, double lon){
     
         double L = 6381372 * Math.PI * 2;//地球周长  
         double W=L;// 平面展开后，x轴等于周长  
         double H=L/2;// y轴约等于周长一半  
         double mill=2.3;// 米勒投影中的一个常数，范围大约在正负2.3之间  
         double x = lon * Math.PI / 180;// 将经度从度数转换为弧度  
         double y = lat * Math.PI / 180;// 将纬度从度数转换为弧度  
         y=1.25 * Math.log( Math.tan( 0.25 * Math.PI + 0.4 * y ) );// 米勒投影的转换  
         // 弧度转为实际距离  
         x = ( W / 2 ) + ( W / (2 * Math.PI) ) * x;  
         y = ( H / 2 ) - ( H / ( 2 * mill ) ) * y;  
         double[] result=new double[2];  
         System.out.println(x);
         System.out.println(y);
         result[0]=x;  
         result[1]=y;  
         return result;  
    }
	
	public static class Point{
   
        private double x;
        private double y;
        public Point(){
   
        }
        public