第二次博客作业

前言：

　　本次博客是对第四次、第五次作业和期中考试的一次总结，第四次、第五次作业相对于前几次的作业难度有大幅度提升，完成代码后对于整体框架仍不是很清晰，代码也修改过多次。

 

设计与分析：

题目集4（7-2）

用户输入一组选项和数据，进行与四边形有关的计算。
以下四边形顶点的坐标要求按顺序依次输入，连续输入的两个顶点是相邻顶点，第一个和最后一个输入的顶点相邻。
选项包括：
1：输入四个点坐标，判断是否是四边形、平行四边形，判断结果输出true/false，结果之间以一个英文空格符分隔。
2：输入四个点坐标，判断是否是菱形、矩形、正方形，判断结果输出true/false，结果之间以一个英文空格符分隔。 若四个点坐标无法构成四边形，输出"not a quadrilateral"
3：输入四个点坐标，判断是凹四边形（false）还是凸四边形(true)，输出四边形周长、面积，结果之间以一个英文空格符分隔。 若四个点坐标无法构成四边形，输出"not a quadrilateral"
4：输入六个点坐标，前两个点构成一条直线，后四个点构成一个四边形或三角形，输出直线与四边形（也可能是三角形）相交的交点数量。如果交点有两个，再按面积从小到大输出四边形(或三角形)被直线分割成两部分的面积（不换行）。若直线与四边形或三角形的一条边线重合，输出"The line is coincide with one of the lines"。若后四个点不符合四边形或三角形的输入，输出"not a quadrilateral or triangle"。
后四个点构成三角形的情况：假设三角形一条边上两个端点分别是x、y，边线中间有一点z，另一顶点s：
1）符合要求的输入：顶点重复或者z与xy都相邻，如x x y s、x z y s、x y x s、s x y y。此时去除冗余点，保留一个x、一个y。
2) 不符合要求的输入：z 不与xy都相邻，如z x y s、x z s y、x s z y
5：输入五个点坐标，输出第一个是否在后四个点所构成的四边形（限定为凸四边形，不考虑凹四边形）或三角形（判定方法见选项4）的内部（若是四边形输出in the quadrilateral/outof the quadrilateral，若是三角形输出in the triangle/outof the triangle）。如果点在多边形的某条边上，输出"on the triangle或者on the quadrilateral"。若后四个点不符合四边形或三角形，输出"not a quadrilateral or triangle"。

输入格式:

基本格式：选项+":"+坐标x+","+坐标y+" "+坐标x+","+坐标y。点的x、y坐标之间以英文","分隔，点与点之间以一个英文空格分隔。

输出格式:

基本输出格式见每种选项的描述。
异常情况输出：
如果不符合基本格式，输出"Wrong Format"。
如果符合基本格式，但输入点的数量不符合要求，输出"wrong number of points"。
注意：输出的数据若小数点后超过3位，只保留小数点后3位，多余部分采用四舍五入规则进到最低位。小数点后若不足3位，按原始位数显示，不必补齐。例如：1/3的结果按格式输出为 0.333，1.0按格式输出为1.0

选项1、2、3中，若四边形四个点中有重合点，输出"points coincide"。
选项4中，若前两个输入线的点重合，输出"points coincide"。

输入样例1:

选项1，点重合。例如：

1:-1,-1 -1,-1 1,2 1,-2

 

输出样例:

在这里给出相应的输出。例如：

points coincide

 

输入样例2:

不符合基本格式。例如：

1:-1,-1 1,2 -1,1 ++1,0

 

输出样例:

在这里给出相应的输出。例如：

Wrong Format

 

输入样例3:

选项1，输入点数量不对。例如：

1:-1,-1 -1,2 

 

输出样例:

在这里给出相应的输出。例如：

wrong number of points

 

输入样例4:

选项1，正确输入判断。例如：

1:-1,-1 -1,1 1,2 1,-2

 

输出样例:

在这里给出相应的输出。例如：

true false

 

输入样例5:

选项2，输入点不构成四边形。例如：

2:10,10 1,1 0,0 1,20

 

输出样例:

在这里给出相应的输出。例如：

not a quadrilateral

 

输入样例6:

选项2，正方形。例如：

2:0,0 0,80 80,80 80,0

 

输出样例:

在这里给出相应的输出。例如：

true true true

 

输入样例7:

选项2。例如：

2:0,0 -10,80 0,160 -10,80

 

输出样例:

在这里给出相应的输出。例如：

not a quadrilateral

 

输入样例8:

选项3，凸四边形。例如：

3:-1,-1 -1,1 1,2 1,-2

 

输出样例:

在这里给出相应的输出。例如：

true 10.472 6.0

 

输入样例9:

选项3，。例如：

3:0,0 -10,100 0,99 10,100

 

输出样例:

在这里给出相应的输出。例如：

false 221.097 990.0

SourceMonito报表

 

 

 类图：

完整代码：

import java.text.DecimalFormat;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        String s2[] = null;
        String s1[] = null;
        String s3[] = null;
        String s4 = "";
        double[] d = new double[30];

        if (!s.matches("^[1-5]:(([+-]?(0|(0\\.\\d+)|[1-9]\\d*(\\.\\d+)?)),([+-]?(0|(0\\.\\d+)|[1-9]\\d*(\\.\\d+)?))\\s?)+$")) {
            System.out.println("Wrong Format");
            System.exit(0);
        }
        int index = 0;
        s3 = s.split(":");
        s1 = s3[1].split(" ");
        for (int i = 0; i < s1.length; i++) {
            s2 = s1[i].split(",");
            for (int j = 0; j < s2.length; j++) {
                if (!check(s2[j])) {
                    System.out.println("Wrong Format");
                    System.exit(0);
                }
                d[index++] = Double.valueOf(s2[j]);
            }
        }
        int num = 0;
        Point[] parr = new Point[10];
        for (int i = 0; i < index; i++) {
            if (i % 2 == 0) {
                parr[num++] = new Point(d[i], d[i + 1]);
            }
        }

        switch (s.charAt(0)) {
            case '1':
                if (index == 8) {
                    if (parr[0].equal(parr[1]) || parr[0].equal(parr[3]) || parr[1].equal(parr[2]) || parr[0].equal(parr[2]) || parr[1].equal(parr[3]) || parr[2].equal(parr[3])) {
                        System.out.println("points coincide");
                        System.exit(0);
                    }
                    Quadrilateral q = new Quadrilateral(parr[0], parr[1], parr[2], parr[3]);
                    if (q.isQuadrilateral()) {
                        System.out.print("true ");
                    } else {
                        System.out.print("false ");
                    }
                    if (q.isParallelQuadrilateral()) {
                        System.out.println("true");
                    } else {
                        System.out.println("false");
                    }
                } else {
                    System.out.println("wrong number of points");
                }
                break;
            case '2':
                if (index == 8) {
                    if (parr[0].equal(parr[1]) || parr[0].equal(parr[3]) || parr[1].equal(parr[2]) || parr[0].equal(parr[2]) || parr[1].equal(parr[3]) || parr[2].equal(parr[3])) {
                        System.out.println("not a quadrilateral");
                        System.exit(0);
                    }
                    Quadrilateral q = new Quadrilateral(parr[0], parr[1], parr[2], parr[3]);
                    if (!q.isQuadrilateral()) {
                        System.out.println("not a quadrilateral");
                        System.exit(0);
                    }
                    System.out.println(q.isDiamond() + " " + q.isRectangle() + " " + q.isSquare());
                } else {
                    System.out.println("wrong number of points");
                }
                break;
            case '3':
                if (index == 8) {
                    if (parr[0].equal(parr[1]) || parr[0].equal(parr[3]) || parr[1].equal(parr[2]) || parr[0].equal(parr[2]) || parr[1].equal(parr[3]) || parr[2].equal(parr[3])) {
                        System.out.println("points coincide");
                        System.exit(0);
                    }
                    Quadrilateral q = new Quadrilateral(parr[0], parr[1], parr[2], parr[3]);
                    if (!q.isQuadrilateral()) {
                        System.out.println("not a quadrilateral");
                        System.exit(0);
                    }
                    System.out.println(q.isConvexQuadrilateral() + " " + new DecimalFormat("0.0##").format(q.sideLength()) + " " + new DecimalFormat("0.0##").format(q.area()));
                } else {
                    System.out.println("wrong number of points");
                }
                break;
            case '4':
                if (index == 12) {
                    Line l = new Line(parr[0], parr[1]);
                    Quadrilateral q = new Quadrilateral(parr[2], parr[3], parr[4], parr[5]);
                    if (!q.isQuadrilateral()) {
                        if (parr[2].equal(parr[5])) {
                            Delta D = new Delta(parr[2], parr[3], parr[4]);
                            judgeDelta(D);
                            if (parr[0].equal(parr[1])) {
                            System.out.println("points coincide");
                            System.exit(0);
                            }
                            D.intersection_point(l);
                        } else if (parr[2].equal(parr[4]) || parr[4].equal(parr[5])) {
                            Delta D = new Delta(parr[2], parr[3], parr[5]);
                            judgeDelta(D);
                            if (parr[0].equal(parr[1])) {
                            System.out.println("points coincide");
                            System.exit(0);
                            }
                            D.intersection_point(l);
                        } else if (parr[2].equal(parr[3]) || parr[3].equal(parr[4]) || parr[3].equal(parr[5])) {
                            Delta D = new Delta(parr[2], parr[4], parr[5]);
                            judgeDelta(D);
                            if (parr[0].equal(parr[1])) {
                            System.out.println("points coincide");
                            System.exit(0);
                            }
                            D.intersection_point(l);
                        } else if (parr[3].equal(parr[4]) || parr[3].equal(parr[5])) {
                            Delta D = new Delta(parr[2], parr[4], parr[5]);
                            judgeDelta(D);
                            if (parr[0].equal(parr[1])) {
                            System.out.println("points coincide");
                            System.exit(0);
                            }
                            D.intersection_point(l);
                        } else if (q.lines[0].getSlope() == q.lines[1].getSlope() && q.lines[2].getSlope() != q.lines[3].getSlope() && q.lines[1].getSlope() != q.lines[2].getSlope() && q.lines[0].getSlope() != q.lines[3].getSlope()) {
                            Line temp = new Line(parr[2], parr[4]);
                            if (!temp.IsMid(parr[3])) {
                                System.out.println("not a quadrilateral or triangle");
                                System.exit(0);
                            }
                            Delta D = new Delta(parr[2], parr[4], parr[5]);
                            judgeDelta(D);
                            if (parr[0].equal(parr[1])) {
                            System.out.println("points coincide");
                            System.exit(0);
                            }
                            D.intersection_point(l);
                        } else if (q.lines[0].getSlope() == q.lines[3].getSlope() && q.lines[2].getSlope() != q.lines[3].getSlope() && q.lines[1].getSlope() != q.lines[2].getSlope() && q.lines[0].getSlope() != q.lines[1].getSlope()) {
                            Line temp = new Line(parr[3], parr[5]);
                            if (!temp.IsMid(parr[2])) {
                                System.out.println("not a quadrilateral or triangle");
                                System.exit(0);
                            }
                            Delta D = new Delta(parr[3], parr[4], parr[5]);
                            judgeDelta(D);
                            if (parr[0].equal(parr[1])) {
                            System.out.println("points coincide");
                            System.exit(0);
                            }
                            D.intersection_point(l);
                        } else if (q.lines[1].getSlope() == q.lines[2].getSlope() && q.lines[2].getSlope() != q.lines[3].getSlope() && q.lines[0].getSlope() != q.lines[1].getSlope() && q.lines[0].getSlope() != q.lines[3].getSlope()) {
                            Line temp = new Line(parr[3], parr[5]);
                            if (!temp.IsMid(parr[4])) {
                                System.out.println("not a quadrilateral or triangle");
                                System.exit(0);
                            }
                            Delta D = new Delta(parr[2], parr[3], parr[5]);
                            judgeDelta(D);
                            if (parr[0].equal(parr[1])) {
                            System.out.println("points coincide");
                            System.exit(0);
                            }
                            D.intersection_point(l);
                        } else if (q.lines[2].getSlope() == q.lines[3].getSlope() && q.lines[0].getSlope() != q.lines[1].getSlope() && q.lines[0].getSlope() != q.lines[3].getSlope() && q.lines[1].getSlope() != q.lines[2].getSlope()) {
                            Line temp = new Line(parr[2], parr[4]);
                            if (!temp.IsMid(parr[5])) {
                                System.out.println("not a quadrilateral or triangle");
                                System.exit(0);
                            }
                            Delta D = new Delta(parr[2], parr[3], parr[4]);
                            judgeDelta(D);
                            if (parr[0].equal(parr[1])) {
                            System.out.println("points coincide");
                            System.exit(0);
                            }
                            D.intersection_point(l);
                        } else if (q.lines[2].getSlope() == q.lines[3].getSlope() && q.lines[0].getSlope() == q.lines[1].getSlope() || q.lines[0].getSlope() == q.lines[3].getSlope() && q.lines[1].getSlope() == q.lines[2].getSlope()){
                            System.out.println("not a quadrilateral or triangle");
                            System.exit(0);
                        }else{
                            System.out.println("not a quadrilateral or triangle");
                            System.exit(0);
                        }
                       
                    } else {
                        q.InterSection_Line(l);
                    }
                } else {
                    System.out.println("wrong number of points");
                }
                break;
            case '5':
                if (index == 10) {
                    Quadrilateral q = new Quadrilateral(parr[1], parr[2], parr[3], parr[4]);
                    if (!q.isQuadrilateral()) {
                        if (parr[1].equal(parr[2])) {
                            Delta D = new Delta(parr[1], parr[3], parr[4]);
                            judgeDelta(D);
                            D.IsInTheTriangle(parr[0]);
                        } else if (parr[1].equal(parr[3]) || parr[2].equal(parr[3])) {
                            Delta D = new Delta(parr[1], parr[2], parr[4]);
                            judgeDelta(D);
                            D.IsInTheTriangle(parr[0]);
                        } else if (parr[1].equal(parr[4]) || parr[2].equal(parr[4]) || parr[3].equal(parr[4])) {
                            Delta D = new Delta(parr[1], parr[2], parr[3]);
                            judgeDelta(D);
                            D.IsInTheTriangle(parr[0]);
                        } else if (q.lines[0].getSlope() == q.lines[1].getSlope() && q.lines[2].getSlope() != q.lines[3].getSlope() && q.lines[1].getSlope() != q.lines[2].getSlope() && q.lines[0].getSlope() != q.lines[3].getSlope()) {
                            Line temp = new Line(parr[1], parr[3]);
                            if (!temp.IsMid(parr[2])) {
                                System.out.println("not a quadrilateral or triangle");
                                System.exit(0);
                            }
                            Delta D = new Delta(parr[1], parr[3], parr[4]);
                            judgeDelta(D);
                            D.IsInTheTriangle(parr[0]);
                        } else if (q.lines[0].getSlope() == q.lines[3].getSlope() && q.lines[2].getSlope() != q.lines[3].getSlope() && q.lines[1].getSlope() != q.lines[2].getSlope() && q.lines[0].getSlope() != q.lines[1].getSlope()) {
                            Line temp = new Line(parr[2], parr[4]);
                            if (!temp.IsMid(parr[1])) {
                                System.out.println("not a quadrilateral or triangle");
                                System.exit(0);
                            }
                            Delta D = new Delta(parr[2], parr[3], parr[4]);
                            judgeDelta(D);
                            D.IsInTheTriangle(parr[0]);
                        } else if (q.lines[1].getSlope() == q.lines[2].getSlope() && q.lines[2].getSlope() != q.lines[3].getSlope() && q.lines[0].getSlope() != q.lines[1].getSlope() && q.lines[0].getSlope() != q.lines[3].getSlope()) {
                            Line temp = new Line(parr[2], parr[4]);
                            if (!temp.IsMid(parr[3])) {
                                System.out.println("not a quadrilateral or triangle");
                                System.exit(0);
                            }
                            Delta D = new Delta(parr[1], parr[2], parr[4]);
                            judgeDelta(D);
                            D.IsInTheTriangle(parr[0]);
                        } else if (q.lines[2].getSlope() == q.lines[3].getSlope() && q.lines[0].getSlope() != q.lines[1].getSlope() && q.lines[0].getSlope() != q.lines[3].getSlope() && q.lines[1].getSlope() != q.lines[2].getSlope()) {
                            Line temp = new Line(parr[1], parr[3]);
                            if (!temp.IsMid(parr[4])) {
                                System.out.println("not a quadrilateral or triangle");
                                System.exit(0);
                            }
                            Delta D = new Delta(parr[1], parr[2], parr[3]);
                            judgeDelta(D);
                            D.IsInTheTriangle(parr[0]);
                        } else if (q.lines[2].getSlope() == q.lines[3].getSlope() && q.lines[0].getSlope() == q.lines[1].getSlope() || q.lines[0].getSlope() == q.lines[3].getSlope() && q.lines[1].getSlope() == q.lines[2].getSlope()) {
                            System.out.println("not a quadrilateral or triangle");
                            System.exit(0);
                        }else{
                            System.out.println("not a quadrilateral or triangle");
                            System.exit(0);
                        }
                    } else {
                        q.IsInTheQuadrilateral(parr[0]);
                    }
                } else {
                    System.out.println("wrong number of points");
                }
                break;
            default:
                System.out.println("Wrong Format");
        }

    }

    public static boolean check(String str) {
        return str.matches("^[+-]?(0|(0\\.\\d+)?|[1-9]\\d*(\\.\\d+)?)$");
    }

    public static void judgeDelta(Delta D) {
        if (!D.isTriangle()) {
            System.out.println("not a quadrilateral or triangle");
            System.exit(0);
        }
    }
}

class Point {
    double x, y;

    Point() {
    }

    Point(double x, double y) {
        this.x = x;
        this.y = y;
    }

    double distance(Point p) {
        return Math.sqrt(Math.pow(this.x - p.x, 2) + Math.pow(this.y - p.y, 2));
    }

    boolean equal(Point p) {
        if (this.x == p.x && this.y == p.y) {
            return true;
        } else {
            return false;
        }
    }
}

class Line {
    Point p1, p2;
    double a, b, c;
    double length;


    Line() {
    }

    Line(Point p1, Point p2) {
        this.p1 = p1;
        this.p2 = p2;
        this.a = p2.y - p1.y;
        this.b = p1.x - p2.x;
        this.c = p2.x * p1.y - p1.x * p2.y;
        this.length = p1.distance(p2);
    }


    public double getSlope() {
        if (b == 0) {
            return 9999;
        } else {
            return -a / b;
        }
    }

    public double getDistance(Point p) {
        return Math.abs(this.a * p.x + this.b * p.y + c) / Math.sqrt(Math.pow(this.a, 2) + Math.pow(this.b, 2));
    }

    public boolean isParallel(Line l) {
        if (this.getSlope() == l.getSlope())
            return true;
        else
            return false;
    }

    public boolean IsSame(Line l) {
        if (this.getSlope() == l.getSlope() && this.getDistance(l.p1) == 0)
            return true;
        else
            return false;
    }

    public boolean IsMid(Point p) {
        if (this.b != 0) {
            if ((this.p2.x >= p.x && this.p1.x <= p.x) || (this.p2.x <= p.x && this.p1.x >= p.x)) {
                return true;
            } else {
                return false;
            }
        } else {
            if ((this.p2.y >= p.y && this.p1.y <= p.y) || (this.p2.y <= p.y && this.p1.y >= p.y)) {
                return true;
            } else {
                return false;
            }
        }
    }

    public double getLength() {
        this.length = this.p1.distance(this.p2);
        return this.length;
    }

    public Point InterSection(Line l) {
        double temp = this.a * l.b - l.a * this.b;
      
        double x = (this.b * l.c - l.b * this.c) / temp;
        double y = (l.a * this.c - this.a * l.c) / temp;
        Point p = new Point(x, y);
        return p;
    }

    public double Calculate(Point p) {
        return this.a * p.x + this.b * p.y + c;
    }

    //点在线的同一侧
    public boolean The_same_side(Point p1, Point p2) {
        if ((Calculate(p1) > 0 && Calculate(p2) > 0) || (Calculate(p1) < 0 && Calculate(p2) < 0)) {
            return true;
        } else {
            return false;
        }
    }
}

class Delta {
    Point p3, p4, p5;
    Line l1, l2, l3;

    Delta() {
    }

    Delta(Point p1, Point p2, Point p3) {
        this.p3 = p1;
        this.p4 = p2;
        this.p5 = p3;
        this.l1 = new Line(this.p3, this.p4);
        this.l2 = new Line(this.p4, this.p5);
        this.l3 = new Line(this.p3, this.p5);
    }

    public boolean isTriangle() {
        if (this.p3.equal(this.p4) || this.p3.equal(this.p5) || this.p4.equal(this.p5)) {
            return false;
        }
        if (this.l1.getDistance(this.p5) < 0.00001 || this.l2.getDistance(this.p3) < 0.00001 || this.l3.getDistance(this.p4) < 0.00001) {
            return false;
        }
        return true;
    }


    public static double area(Point p1, Point p2, Point p3) {
        double[] length = new double[3];
        length[0] = p1.distance(p2);
        length[1] = p2.distance(p3);
        length[2] = p3.distance(p1);
        double p = (length[1] + length[0] + length[2]) / 2;
        return Math.sqrt(p * (p - length[0]) * (p - length[1]) * (p - length[2]));
    }


    void intersection_point(Line l) {
        Point temp1 = new Point();
        Point temp2 = new Point();
        Point temp3 = new Point();
        temp1 = l.InterSection(this.l1);
        temp2 = l.InterSection(this.l2);
        temp3 = l.InterSection(this.l3);
        int num1 = 0;
        int num2 = 0;
        int num3 = 0;
        if (l.IsSame(this.l3) || l.IsSame(this.l2) || l.IsSame(this.l1)) {
            System.out.println("The line is coincide with one of the lines");
            return;
        }
        if (this.l1.IsMid(temp1)) {
            num1++;
        }
        if (this.l2.IsMid(temp2)) {
            num2++;
        }
        if (this.l3.IsMid(temp3)) {
            num3++;
        }
        if (num1 + num2 + num3 == 2) {
            if (num1 == 1 && num2 == 1) {
                if (temp1.equal(temp2)) {
                    System.out.println("1");
                } else {
                    Line tempLine = new Line(temp1, temp2);
                    double areaAll = 0.5 * l1.length * l1.getDistance(this.p5);
                    double area = 0.5 * temp1.distance(temp2) * tempLine.getDistance(this.p4);
                    Show_area(area, areaAll - area);
                }
            } else if (num1 == 1 && num3 == 1) {
                if (temp1.equal(temp3)) {
                    System.out.println("1");
                } else {
                    Line tempLine = new Line(temp1, temp3);
                    double areaAll = 0.5 * l1.length * l1.getDistance(this.p5);
                    double area = 0.5 * temp1.distance(temp3) * tempLine.getDistance(this.p3);
                    Show_area(area, areaAll - area);
                }
            } else if (num2 == 1 && num3 == 1) {
                if (temp2.equal(temp3)) {
                    System.out.println("1");
                } else {
                    Line tempLine = new Line(temp2, temp3);
                    double areaAll = 0.5 * l1.length * l1.getDistance(this.p5);
                    double area = 0.5 * temp3.distance(temp2) * tempLine.getDistance(this.p5);
                    Show_area(area, areaAll - area);
                }
            }
        } else if (num1 + num2 + num3 == 3) {
            if (temp1.equal(temp2)) {
                Line tempLine = new Line(temp1, temp3);
                double areaAll = 0.5 * l1.length * l1.getDistance(this.p5);
                double area = 0.5 * temp1.distance(temp3) * tempLine.getDistance(this.p3);
                Show_area(area, areaAll - area);
            } else if (temp1.equal(temp3)) {
                Line tempLine = new Line(temp2, temp3);
                double areaAll = 0.5 * l1.length * l1.getDistance(this.p5);
                double area = 0.5 * temp3.distance(temp2) * tempLine.getDistance(this.p5);
                Show_area(area, areaAll - area);
            } else if (temp2.equal(temp3)) {
                Line tempLine = new Line(temp1, temp2);
                double areaAll = 0.5 * l1.length * l1.getDistance(this.p5);
                double area = 0.5 * temp1.distance(temp2) * tempLine.getDistance(this.p4);
                Show_area(area, areaAll - area);
            }
        } else {
            System.out.println(num1 + num2 + num3);
        }
    }

    public static void Show_area(double area1, double area2) {
        if (area1 > area2) {
            System.out.println("2 " + new DecimalFormat("0.0#####").format(area2) + " " + new DecimalFormat("0.0#####").format(area1));
        } else {
            System.out.println("2 " + new DecimalFormat("0.0#####").format(area1) + " " + new DecimalFormat("0.0#####").format(area2));
        }
    }


    public void IsInTheTriangle(Point p) {
        Point temp1 = new Point();
        Point temp2 = new Point();
        Line l = new Line();
        l.p1 = p;
        l.a = this.l1.a;
        l.b = this.l1.b;
        l.c = -l.a * l.p1.x - l.b * l.p1.y;
        temp1 = l.InterSection(this.l2);
        temp2 = l.InterSection(this.l3);
        l.p1 = temp1;
        l.p2 = temp2;
        if ((this.l1.getDistance(p) == 0 && l1.IsMid(p)) || (this.l2.getDistance(p) == 0 && l2.IsMid(p)) || (l3.IsMid(p) && this.l3.getDistance(p) == 0)) {
            System.out.println("on the triangle");
            return;
        }
        if ((this.l1.getDistance(p) == 0 && !l1.IsMid(p)) || (this.l2.getDistance(p) == 0 && !l2.IsMid(p)) || (!l3.IsMid(p) && this.l3.getDistance(p) == 0)) {
            System.out.println("outof the triangle");
            return;
        }
        if (temp1.equal(temp2)) {
            System.out.println("outof the triangle");
            return;
        }
        if (!this.l2.IsMid(temp1) || !this.l3.IsMid(temp2)) {
            System.out.println("outof the triangle");
            return;
        }
        if (this.l2.IsMid(temp1) && this.l3.IsMid(temp2)) {
            if (l.IsMid(p)) {
                System.out.println("in the triangle");
                return;
            } else {
                System.out.println("outof the triangle");
                return;
            }
        }
    }
}

class Quadrilateral {
    public Point[] points;
    public Line[] lines;

    Quadrilateral() {
    }

    Quadrilateral(Point p1, Point p2, Point p3, Point p4) {
        this.points = new Point[4];
        this.lines = new Line[4];
        this.points[0] = p1;
        this.points[1] = p2;
        this.points[2] = p3;
        this.points[3] = p4;
        this.lines[0] = new Line(p1, p2);
        this.lines[1] = new Line(p2, p3);
        this.lines[2] = new Line(p3, p4);
        this.lines[3] = new Line(p4, p1);

//        if (p1.equal(p2) || p1.equal(p3) || p1.equal(p4) || p2.equal(p3) || p2.equal(p4) || p3.equal(p4)) {
//            System.out.println("points coincide");
//            System.exit(0);
//        }
//        if (this.lines[0].isParallel(this.lines[1]) || this.lines[0].isParallel(this.lines[3]) || this.lines[2].isParallel(this.lines[1]) || this.lines[2].isParallel(this.lines[3])) {
//            System.out.println("not a quadrilateral");
//            System.exit(0);
//        }
//
//        Point p0 = this.lines[0].InterSection(this.lines[2]);
//        Point p5 = this.lines[1].InterSection(this.lines[3]);
//        if (p0 != null && (this.lines[0].IsMid(p0) && this.lines[2].IsMid(p0)) || p5 != null && (this.lines[1].IsMid(p5) && this.lines[3].IsMid(p5))) {
//            System.out.println("not a quadrilateral");
//            System.exit(0);
//        }
    }

    public boolean isQuadrilateral() {
        if (this.lines[0].isParallel(this.lines[1]) || this.lines[0].isParallel(this.lines[3]) || this.lines[2].isParallel(this.lines[1]) || this.lines[2].isParallel(this.lines[3])) {
            return false;
        }

        Point p0 = null;
        Point p5 = null;
        if(!this.lines[0].isParallel(this.lines[2])){
            p0 = this.lines[0].InterSection(this.lines[2]);
        }
        if(!this.lines[1].isParallel(this.lines[3])){
            p5 = this.lines[1].InterSection(this.lines[3]);
        }
        if (p0 != null && (this.lines[0].IsMid(p0) && this.lines[2].IsMid(p0)) || p5 != null && (this.lines[1].IsMid(p5) && this.lines[3].IsMid(p5))) {
            return false;
        }
        return true;
    }

    //是否为平行四边形
    public boolean isParallelQuadrilateral() {
        return this.lines[0].isParallel(this.lines[2]) && this.lines[1].isParallel(this.lines[3]);
    }

    //是否为菱形
    public boolean isDiamond() {
        boolean flag = this.lines[1].length == this.lines[0].length && this.lines[1].length == this.lines[2].length && this.lines[2].length == this.lines[3].length;
        return this.isParallelQuadrilateral() && flag;
    }

    //是否为矩形
    public boolean isRectangle() {
        return this.points[0].distance(this.points[2]) == this.points[1].distance(this.points[3]);
    }

    //是否为正方形
    public boolean isSquare() {
        return this.isDiamond() && this.isRectangle();
    }

    //是否为凸四边形
    public boolean isConvexQuadrilateral() {
        double[] s = new double[4];
        s[0] = Delta.area(this.points[0], this.points[1], this.points[2]);
        s[1] = Delta.area(this.points[1], this.points[2], this.points[3]);
        s[2] = Delta.area(this.points[0], this.points[1], this.points[3]);
        s[3] = Delta.area(this.points[0], this.points[2], this.points[3]);
        return Math.abs(s[0] + s[1] - s[2] - s[3]) < 0.0001;
    }

    //四边形周长
    public double sideLength() {
        return this.lines[0].length + this.lines[1].length + this.lines[2].length + this.lines[3].length;
    }

    //四边形面积
    public double area() {
        double[] s = new double[4];
        s[0] = Delta.area(this.points[0], this.points[1], this.points[2]);
        s[1] = Delta.area(this.points[0], this.points[2], this.points[3]);

        s[2] = Delta.area(this.points[0], this.points[1], this.points[3]);
        s[3] = Delta.area(this.points[1], this.points[2], this.points[3]);

        return Math.min(s[0] + s[1], s[2] + s[3]);
    }

    //线切割四边形
    public void InterSection_Line(Line l) {
        int num1 = 0;
        int num2 = 0;
        int num3 = 0;
        int num4 = 0;
        Point temp1;
        Point temp2;
        Point temp3;
        Point temp4;
        temp1 = l.InterSection(this.lines[0]);
        temp2 = l.InterSection(this.lines[1]);
        temp3 = l.InterSection(this.lines[2]);
        temp4 = l.InterSection(this.lines[3]);
        if (l.IsSame(this.lines[0]) || l.IsSame(this.lines[1]) || l.IsSame(this.lines[2]) || l.IsSame(this.lines[3])) {
            System.out.println("The line is coincide with one of the lines");
            return;
        }
        if (this.lines[0].IsMid(temp1)) {
            num1++;
        }
        if (this.lines[1].IsMid(temp2)) {
            num2++;
        }
        if (this.lines[2].IsMid(temp3)) {
            num3++;
        }
        if (this.lines[3].IsMid(temp4)) {
            num4++;
        }
        int sum = num1 + num2 + num3 + num4;
        double areaAll = area();
        if (sum == 2) {
            if (num1 == 1 && num2 == 1) {
                if (temp1.equal(temp2)) {
                    System.out.println("1");
                } else {
                    Line tempLine = new Line(temp1, temp2);
                    double area = 0.5 * temp1.distance(temp2) * tempLine.getDistance(this.points[1]);
                    Delta.Show_area(area, areaAll);
                }
            } else if (num1 == 1 && num3 == 1) {
                Line tempLine = new Line(temp1, temp3);
                Quadrilateral q = new Quadrilateral(temp1, temp3, this.points[2], this.points[1]);
                double area = q.area();
                Delta.Show_area(area, areaAll - area);
            } else if (num1 == 1 && num4 == 1) {
                if (temp1.equal(temp4)) {
                    System.out.println("1");
                } else {
                    Line tempLine = new Line(temp1, temp4);
                    //Quadrilateral q = new Quadrilateral(temp1, temp3, this.points[1], this.points[2]);
                    double area = 0.5 * temp1.distance(temp4) * tempLine.getDistance(this.points[0]);
                    Delta.Show_area(area, areaAll - area);
                }
            } else if (num2 == 1 && num3 == 1) {
                if (temp2.equal(temp3)) {
                    System.out.println("1");
                } else {
                    Line tempLine = new Line(temp2, temp3);
                    //Quadrilateral q = new Quadrilateral(temp1, temp3, this.points[1], this.points[2]);
                    double area = 0.5 * temp2.distance(temp3) * tempLine.getDistance(this.points[2]);
                    Delta.Show_area(area, areaAll - area);
                }
            } else if (num2 == 1 && num4 == 1) {
                Line tempLine = new Line(temp2, temp4);
                Quadrilateral q = new Quadrilateral(temp2, temp4, this.points[0], this.points[1]);
                double area = q.area();
                Delta.Show_area(area, areaAll - area);
            } else if (num3 == 1 && num4 == 1) {
                if (temp3.equal(temp4)) {
                    System.out.println("1");
                } else {
                    Line tempLine = new Line(temp3, temp4);
                    //Quadrilateral q = new Quadrilateral(temp2, temp4, this.points[0], this.points[1]);
                    double area = 0.5 * temp3.distance(temp4) * tempLine.getDistance(this.points[3]);
                    Delta.Show_area(area, areaAll - area);
                }
            }
        } else if (sum == 3) {
            if (num1 == 1 && num2 == 1 && num3 == 1) {
                if (temp1.equal(temp2)) {
                    Line tempLine = new Line(temp1, temp3);
                    double area = 0.5 * tempLine.getDistance(this.points[2]) * tempLine.length;
                    Delta.Show_area(area, areaAll - area);
                } else if (temp2.equal(temp3)) {
                    Line tempLine = new Line(temp1, temp2);
                    double area = 0.5 * tempLine.getDistance(this.points[1]) * tempLine.length;
                    Delta.Show_area(area, areaAll - area);
                }
            } else if (num1 == 1 && num2 == 1 && num4 == 1) {
                if (temp1.equal(temp2)) {
                    Line tempLine = new Line(temp1, temp4);
                    double area = 0.5 * tempLine.getDistance(this.points[0]) * tempLine.length;
                    Delta.Show_area(area, areaAll - area);
                } else if (temp1.equal(temp4)) {
                    Line tempLine = new Line(temp1, temp2);
                    double area = 0.5 * tempLine.getDistance(this.points[1]) * tempLine.length;
                    Delta.Show_area(area, areaAll - area);
                }
            } else if (num1 == 1 && num3 == 1 && num4 == 1) {
                if (temp1.equal(temp4)) {
                    Line tempLine = new Line(temp1, temp2);
                    double area = 0.5 * tempLine.getDistance(this.points[1]) * tempLine.length;
                    Delta.Show_area(area, areaAll - area);
                } else if (temp3.equal(temp4)) {
                    Line tempLine = new Line(temp1, temp4);
                    double area = 0.5 * tempLine.length * tempLine.getDistance(this.points[0]);
                    Delta.Show_area(area, areaAll - area);
                }
            } else if (num2 == 1 && num3 == 1 && num4 == 1) {
                if (temp2.equal(temp3)) {
                    Line tempLine = new Line(temp2, temp4);
                    double area = 0.5 * tempLine.length * tempLine.getDistance(this.points[3]);
                    Delta.Show_area(area, areaAll - area);
                } else if (temp3.equal(temp4)) {
                    Line tempLine = new Line(temp2, temp3);
                    double area = 0.5 * tempLine.length * tempLine.getDistance(this.points[2]);
                    Delta.Show_area(area, areaAll - area);
                }
            }
        } else if (sum == 4) {
            if (this.isConvexQuadrilateral()) {
                if (temp1.equal(temp2) && temp3.equal(temp4)) {
                    Line tempLine = new Line(temp1, temp3);
                    double area = 0.5 * tempLine.length * tempLine.getDistance(this.points[0]);
                    Delta.Show_area(area, areaAll - area);
                } else if (temp1.equal(temp4) && temp3.equal(temp2)) {
                    Line tempLine = new Line(temp1, temp2);
                    double area = 0.5 * tempLine.length * tempLine.getDistance(this.points[1]);
                    Delta.Show_area(area, areaAll - area);
                }
            } else {
                Line tempLine1 = new Line(this.points[0], this.points[2]);
                Line tempLine2 = new Line(this.points[1], this.points[3]);
                if (tempLine1.The_same_side(this.points[1], this.points[3])) {

                } else if (tempLine2.The_same_side(this.points[0], this.points[3])) {

                }

            }
        }
    }

    //点是否在四边形内
public void IsInTheQuadrilateral(Point p) {
        Point temp1 = null;
        Point temp2 = null;
        Point temp3 = null;
        Line l = new Line();
        l.p1 = p;
        l.a = this.lines[0].a;
        l.b = this.lines[0].b;
        l.c = -l.a * l.p1.x - l.b * l.p1.y;
        temp1 = l.InterSection(this.lines[1]);
        temp2 = l.InterSection(this.lines[2]);
        temp3 = l.InterSection(this.lines[3]);
        int temp=0;
        if ((this.lines[0].getDistance(p) == 0 && this.lines[0].IsMid(p)) || (this.lines[1].getDistance(p) == 0 && this.lines[1].IsMid(p)) || (this.lines[2].getDistance(p) == 0 && this.lines[2].IsMid(p)) || (this.lines[3].getDistance(p) == 0 && this.lines[3].IsMid(p))) {
            System.out.println("on the quadrilateral");
            return;
        }
        if ((this.lines[0].getDistance(p) == 0 && !this.lines[0].IsMid(p)) || (this.lines[1].getDistance(p) == 0 && !this.lines[1].IsMid(p)) || (this.lines[2].getDistance(p) == 0 && !this.lines[2].IsMid(p)) || (this.lines[3].getDistance(p) == 0 && !this.lines[3].IsMid(p))) {
//             System.out.println("outof the quadrilateral");
//             return;
            
        }
        if (temp1.equal(temp2) || temp2.equal(temp3)) {
//             System.out.println("outof the quadrilateral");
//             return;
        }
        if ((this.lines[1].IsMid(temp1) && this.lines[2].IsMid(temp2))) {
            l.p2 = temp2;
            l.p1 = temp1;
            if (l.IsMid(p)) {
//                 System.out.println("in the quadrilateral");
//                 return;
                temp++;
            } else {
//                 System.out.println("outof the quadrilateral");
//                 return;
            }
        }
    if(this.lines[1].IsMid(temp1) && this.lines[3].IsMid(temp3)){
            l.p2 = temp3;
            l.p1 = temp1;
            if (l.IsMid(p)) {
//                 System.out.println("in the quadrilateral");
//                 return;
                temp++;
            } else {
//                 System.out.println("outof the quadrilateral");
//                 return;
            }
        }
    if(this.lines[3].IsMid(temp3) && this.lines[2].IsMid(temp2)){
            l.p2 = temp3;
            l.p1 = temp2;
            if (l.IsMid(p)) {
//                 System.out.println("in the quadrilateral");
//                 return;
                temp++;
            } else {
//                 System.out.println("outof the quadrilateral");
//                 return;
            }
        }
    if(temp==0){
        System.out.println("outof the quadrilateral");
    }else{
        System.out.println("in the quadrilateral");
    }
    }
}

这里的判断点在四边形内与三角形内相同，应该全部提取出来写一个父类。

这次难度较难，在判断点在四边形内修改了多次。

题目集5（7-1）

用户输入一组选项和数据，进行与五边形有关的计算。
以下五边形顶点的坐标要求按顺序依次输入，连续输入的两个顶点是相邻顶点，第一个和最后一个输入的顶点相邻。
选项包括：
1：输入五个点坐标，判断是否是五边形，判断结果输出true/false。
2：输入五个点坐标，判断是凹五边形（false）还是凸五边形(true)，如果是凸五边形，则再输出五边形周长、面积，结果之间以一个英文空格符分隔。 若五个点坐标无法构成五边形，输出"not a pentagon"
3：输入七个点坐标，前两个点构成一条直线，后五个点构成一个凸五边形、凸四边形或凸三角形，输出直线与五边形、四边形或三角形相交的交点数量。如果交点有两个，再按面积从小到大输出被直线分割成两部分的面积（不换行）。若直线与多边形形的一条边线重合，输出"The line is coincide with one of the lines"。若后五个点不符合五边形输入，若前两点重合，输出"points coincide"。

以上3选项中，若输入的点无法构成多边形，则输出"not a polygon"。输入的五个点坐标可能存在冗余，假设多边形一条边上两个端点分别是x、y，边线中间有一点z，另一顶点s：
1）符合要求的输入：顶点重复或者z与xy都相邻，如：x x y s、x z y s、x y x s、s x y y。此时去除冗余点，保留一个x、一个y。
2) 不符合要求的输入：z不与xy都相邻，如：z x y s、x z s y、x s z y

输入格式:

基本格式：选项+":"+坐标x+","+坐标y+" "+坐标x+","+坐标y。点的x、y坐标之间以英文","分隔，点与点之间以一个英文空格分隔。

输出格式:

基本输出格式见每种选项的描述。
异常情况输出：
如果不符合基本格式，输出"Wrong Format"。
如果符合基本格式，但输入点的数量不符合要求，输出"wrong number of points"。
注意：输出的数据若小数点后超过3位，只保留小数点后3位，多余部分采用四舍五入规则进到最低位。小数点后若不足3位，按原始位数显示，不必补齐。例如：1/3的结果按格式输出为 0.333，1.0按格式输出为1.0

输入样例1:

选项1，点重合。例如：

1:-1,-1 1,2 -1,1 1,0

 

输出样例:

在这里给出相应的输出。例如：

wrong number of points

SourceMonito报表

 类图：

 完整代码：

import java.text.DecimalFormat;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        String s2[] = null;
        String s1[] = null;
        String s3[] = null;
        String s4 = "";
        double[] d = new double[30];

        if (!s.matches("^[1-5]:(([+-]?(0|(0\\.\\d+)|[1-9]\\d*(\\.\\d+)?)),([+-]?(0|(0\\.\\d+)|[1-9]\\d*(\\.\\d+)?))\\s?)+$")) {
            System.out.println("Wrong Format");
            System.exit(0);
        }
        int index = 0;
        s3 = s.split(":");
        s1 = s3[1].split(" ");
        for (int i = 0; i < s1.length; i++) {
            s2 = s1[i].split(",");
            for (int j = 0; j < s2.length; j++) {
                if (!check(s2[j])) {
                    System.out.println("Wrong Format");
                    System.exit(0);
                }
                d[index++] = Double.valueOf(s2[j]);
            }
        }

        int num = 0;
        Point[] parr = new Point[10];
        for (int i = 0; i < index; i++) {
            if (i % 2 == 0) {
                parr[num++] = new Point(d[i], d[i + 1]);
            }
        }

        switch (s.charAt(0)) {
            case '1':
                if (index == 10) {
                    Pentagon p = new Pentagon(parr, 5);
                    System.out.println(p.IsPolygon());
                } else {
                    System.out.println("wrong number of points");
                }
                break;
            case '2':
                if (index == 10) {
                    Pentagon p = new Pentagon(parr, 5);
                    if (p.IsPolygon()) {
                        if (p.isConvexPolygon()) {
                            System.out.println(true + " " + new DecimalFormat("0.0##").format(p.sideLength()) + " " + p.getArea());
                        } else {
                            System.out.println(false);
                        }
                    } else {
                        System.out.println("not a pentagon");
                    }
                } else {
                    System.out.println("wrong number of points");
                }
                break;
            case '3':
                if (index == 14) {
                    if (parr[0].equal(parr[1])) {
                        System.out.println("points coincide");
                        System.exit(0);
                    }
                    Point[] point = {parr[2], parr[3], parr[4], parr[5], parr[6]};
                    Pentagon p = new Pentagon(point, 5);
                    Line l = new Line(parr[0], parr[1]);
                    if (!Point_equal(point) && p.IsPolygon()) {
                        p.Intersection(l);
                        System.exit(0);
                    }
                    if (parr[2].equal(parr[3])) {
                        Point[] p5 = {parr[3], parr[4], parr[5], parr[6]};
                        Quadrilateral q = new Quadrilateral(p5, 4);
                        if (q.IsPolygon()) {
                            q.Intersection(l);
                            System.exit(0);
                        } else {
                            sj(q, l);
                        }
                    } else if (parr[3].equal(parr[4]) || parr[4].equal(parr[5])) {
                        Point[] p4 = {parr[2], parr[3], parr[5], parr[6]};
                        Quadrilateral q = new Quadrilateral(p4, 4);
                        if (q.IsPolygon()) {
                            q.Intersection(l);
                            System.exit(0);

                        }else{
                            sj(q, l);
                        }
                    } else if (parr[5].equal(parr[6]) || parr[6].equal(parr[2])) {
                        Point[] p1 = {parr[2], parr[3], parr[4], parr[5]};
                        Quadrilateral q = new Quadrilateral(p1, 4);
                        if (q.IsPolygon()) {
                            q.Intersection(l);
                            System.exit(0);

                        }else{
                            sj(q, l);
                        }
                    } else if (p.lines[0].isParallel(p.lines[1])) {
                        Line temp = new Line(point[0], point[2]);
                        if (temp.IsMid(point[1])) {
                            Point[] points = {point[0], point[2], point[3], point[4]};
                            Quadrilateral q = new Quadrilateral(points, 4);
                            q.Intersection(l);
                        } else {
                            System.out.println("not a polygon");
                        }
                    } else if (p.lines[1].isParallel(p.lines[2])) {
                        Line temp = new Line(point[1], point[3]);
                        if (temp.IsMid(point[2])) {
                            Point[] points = {point[0], point[1], point[3], point[4]};
                            Quadrilateral q = new Quadrilateral(points, 4);
                            q.Intersection(l);
                        } else {
                            System.out.println("not a polygon");
                        }
                    } else if (p.lines[2].isParallel(p.lines[3])) {
                        Line temp = new Line(point[2], point[4]);
                        if (temp.IsMid(point[3])) {
                            Point[] points = {point[0], point[1], point[2], point[4]};
                            Quadrilateral q = new Quadrilateral(points, 4);
                            q.Intersection(l);
                        } else {
                            System.out.println("not a polygon");
                        }
                    } else if (p.lines[3].isParallel(p.lines[4])) {
                        Line temp = new Line(point[3], point[0]);
                        if (temp.IsMid(point[4])) {
                            Point[] points = {point[0], point[1], point[2], point[3]};
                            Quadrilateral q = new Quadrilateral(points, 4);
                            q.Intersection(l);
                        } else {
                            System.out.println("not a polygon");
                        }
                    } else if (p.lines[4].isParallel(p.lines[0])) {
                        Line temp = new Line(point[1], point[4]);
                        if (temp.IsMid(point[0])) {
                            Point[] points = {point[1], point[2], point[3], point[4]};
                            Quadrilateral q = new Quadrilateral(points, 4);
                            q.Intersection(l);
                        } else {
                            System.out.println("not a polygon");
                        }
                    }
                } else {
                    System.out.println("wrong number of points");
                }
                break;
        }

    }

    public static boolean check(String str) {
        return str.matches("^[+-]?(0|(0\\.\\d+)?|[1-9]\\d*(\\.\\d+)?)$");
    }

    public static boolean Point_equal(Point[] points) {
        for (int i = 0; i < points.length; i++) {
            for (int j = i + 1; j < points.length; j++) {
                if (points[i].equal(points[j])) {
                    return true;
                }
            }
        }
        return false;
    }

    public static void judgeDelta(Triangle D) {
        if (!D.IsPolygon()) {
            System.out.println("not a polygon");
            System.exit(0);
        }
    }

    public static void sj(Quadrilateral q, Line l) {
        Point[] parr = new Point[4];
        for (int i = 0; i < 4; i++) {
            parr[i] = q.points[i];
        }
        if (parr[0].equal(parr[1])) {
            Point[] points = {parr[0], parr[2], parr[3]};
            Triangle D = new Triangle(points, 3);
            judgeDelta(D);
            D.Intersection(l);
        } else if (parr[0].equal(parr[2]) || parr[1].equal(parr[2])) {
            Point[] points = {parr[0], parr[1], parr[3]};
            Triangle D = new Triangle(points, 3);
            judgeDelta(D);
            D.Intersection(l);
        } else if (parr[0].equal(parr[3]) || parr[1].equal(parr[3]) || parr[2].equal(parr[3])) {
            Point[] points = {parr[0], parr[1], parr[2]};
            Triangle D = new Triangle(points, 3);
            judgeDelta(D);
            D.Intersection(l);
        } else if (q.lines[0].getSlope() == q.lines[1].getSlope() && q.lines[2].getSlope() != q.lines[3].getSlope() && q.lines[1].getSlope() != q.lines[2].getSlope() && q.lines[0].getSlope() != q.lines[3].getSlope()) {
            Line temp = new Line(parr[0], parr[2]);
            if (!temp.IsMid(parr[1])) {
                System.out.println("not a polygon");
                System.exit(0);
            }
            Point[] points = {parr[0], parr[2], parr[3]};
            Triangle D = new Triangle(points, 3);
            judgeDelta(D);
            D.Intersection(l);
        } else if (q.lines[0].getSlope() == q.lines[3].getSlope() && q.lines[2].getSlope() != q.lines[3].getSlope() && q.lines[1].getSlope() != q.lines[2].getSlope() && q.lines[0].getSlope() != q.lines[1].getSlope()) {
            Line temp = new Line(parr[1], parr[3]);
            if (!temp.IsMid(parr[0])) {
                System.out.println("not a polygon");
                System.exit(0);
            }
            Point[] points = {parr[1], parr[2], parr[3]};
            Triangle D = new Triangle(points, 3);
            judgeDelta(D);
            D.Intersection(l);
        } else if (q.lines[1].getSlope() == q.lines[2].getSlope() && q.lines[2].getSlope() != q.lines[3].getSlope() && q.lines[0].getSlope() != q.lines[1].getSlope() && q.lines[0].getSlope() != q.lines[3].getSlope()) {
            Line temp = new Line(parr[1], parr[3]);
            if (!temp.IsMid(parr[2])) {
                System.out.println("not a polygon");
                System.exit(0);
            }
            Point[] points = {parr[0], parr[1], parr[3]};
            Triangle D = new Triangle(points, 3);
            judgeDelta(D);
            D.Intersection(l);
        } else if (q.lines[2].getSlope() == q.lines[3].getSlope() && q.lines[0].getSlope() != q.lines[1].getSlope() && q.lines[0].getSlope() != q.lines[3].getSlope() && q.lines[1].getSlope() != q.lines[2].getSlope()) {
            Line temp = new Line(parr[0], parr[2]);
            if (!temp.IsMid(parr[3])) {
                System.out.println("not a polygon");
                System.exit(0);
            }
            Point[] points = {parr[0], parr[1], parr[2]};
            Triangle D = new Triangle(points, 3);
            judgeDelta(D);
            D.Intersection(l);
        } else if (q.lines[2].getSlope() == q.lines[3].getSlope() && q.lines[0].getSlope() == q.lines[1].getSlope() || q.lines[0].getSlope() == q.lines[3].getSlope() && q.lines[1].getSlope() == q.lines[2].getSlope()) {
            System.out.println("not a polygon");
            System.exit(0);
        } else {
            System.out.println("not a polygon");
            System.exit(0);
        }
    }
}

class Point {
    double x, y;

    Point() {
    }

    Point(double x, double y) {
        this.x = x;
        this.y = y;
    }

    double distance(Point p) {
        return Math.sqrt(Math.pow(this.x - p.x, 2) + Math.pow(this.y - p.y, 2));
    }

    boolean equal(Point p) {
        if (this.x == p.x && this.y == p.y) {
            return true;
        } else {
            return false;
        }
    }
}

class Line {
    Point p1, p2;
    double a, b, c;
    double length;


    Line() {
    }

    Line(Point p1, Point p2) {
        this.p1 = p1;
        this.p2 = p2;
        this.a = p2.y - p1.y;
        this.b = p1.x - p2.x;
        this.c = p2.x * p1.y - p1.x * p2.y;
        this.length = p1.distance(p2);
    }


    public double getSlope() {
        if (b == 0) {
            return 9999;
        } else {
            return -a / b;
        }
    }

    public double getDistance(Point p) {
        return Math.abs(this.a * p.x + this.b * p.y + c) / Math.sqrt(Math.pow(this.a, 2) + Math.pow(this.b, 2));
    }

    public boolean isParallel(Line l) {
        if (this.getSlope() == l.getSlope())
            return true;
        else
            return false;
    }

    public boolean IsSame(Line l) {
        if (this.getSlope() == l.getSlope() && this.getDistance(l.p1) == 0)
            return true;
        else
            return false;
    }

    public boolean IsMid(Point p) {
        if (this.b != 0) {
            if ((this.p2.x >= p.x && this.p1.x <= p.x) || (this.p2.x <= p.x && this.p1.x >= p.x)) {
                return true;
            } else {
                return false;
            }
        } else {
            if ((this.p2.y >= p.y && this.p1.y <= p.y) || (this.p2.y <= p.y && this.p1.y >= p.y)) {
                return true;
            } else {
                return false;
            }
        }
    }

    public double getLength() {
        this.length = this.p1.distance(this.p2);
        return this.length;
    }

    public Point InterSection(Line l) {
        double temp = this.a * l.b - l.a * this.b;
        double x = (this.b * l.c - l.b * this.c) / temp;
        double y = (l.a * this.c - this.a * l.c) / temp;
        Point p = new Point(x, y);
        return p;
    }

    public double Calculate(Point p) {
        return this.a * p.x + this.b * p.y + c;
    }

    //点在线的同一侧
    public boolean The_same_side(Point p1, Point p2) {
        if ((Calculate(p1) > 0 && Calculate(p2) > 0) || (Calculate(p1) < 0 && Calculate(p2) < 0)) {
            return true;
        } else {
            return false;
        }
    }
}

class Triangle extends Polygon {

    Triangle() {
    }

    Triangle(Point[] points, int num) {
        super(points, num);
    }

    @Override
    public boolean IsPolygon() {
        if (this.points[0].equal(this.points[1]) || this.points[0].equal(this.points[2]) || this.points[1].equal(this.points[2])) {
            return false;
        }
        if (this.lines[0].getDistance(this.points[2]) < 0.00001 || this.lines[1].getDistance(this.points[0]) < 0.00001 || this.lines[2].getDistance(this.points[1]) < 0.00001) {
            return false;
        }
        return true;
    }


    public static double area(Point p1, Point p2, Point p3) {
        double[] length = new double[3];
        length[0] = p1.distance(p2);
        length[1] = p2.distance(p3);
        length[2] = p3.distance(p1);
        double p = (length[1] + length[0] + length[2]) / 2;
        return Math.sqrt(p * (p - length[0]) * (p - length[1]) * (p - length[2]));
    }


    @Override
    public void Intersection(Line l) {
        Point temp1 = new Point();
        Point temp2 = new Point();
        Point temp3 = new Point();
        temp1 = l.InterSection(this.lines[0]);
        temp2 = l.InterSection(this.lines[1]);
        temp3 = l.InterSection(this.lines[2]);
        int num1 = 0;
        int num2 = 0;
        int num3 = 0;
        if (l.IsSame(this.lines[2]) || l.IsSame(this.lines[1]) || l.IsSame(this.lines[0])) {
            System.out.println("The line is coincide with one of the lines");
            return;
        }
        if (this.lines[0].IsMid(temp1)) {
            num1++;
        }
        if (this.lines[1].IsMid(temp2)) {
            num2++;
        }
        if (this.lines[2].IsMid(temp3)) {
            num3++;
        }
        double areaAll = 0.5 * this.lines[0].length * this.lines[0].getDistance(this.points[2]);
        if (num1 + num2 + num3 == 2) {
            if (num1 == 1 && num2 == 1) {
                if (temp1.equal(temp2)) {
                    System.out.println("1");
                } else {
                    Line tempLine = new Line(temp1, temp2);
                    double area = 0.5 * temp1.distance(temp2) * tempLine.getDistance(this.points[1]);
                    Show_area(area, areaAll - area);
                }
            } else if (num1 == 1 && num3 == 1) {
                if (temp1.equal(temp3)) {
                    System.out.println("1");
                } else {
                    Line tempLine = new Line(temp1, temp3);
                    double area = 0.5 * temp1.distance(temp3) * tempLine.getDistance(this.points[0]);
                    Show_area(area, areaAll - area);
                }
            } else if (num2 == 1 && num3 == 1) {
                if (temp2.equal(temp3)) {
                    System.out.println("1");
                } else {
                    Line tempLine = new Line(temp2, temp3);
                    double area = 0.5 * temp3.distance(temp2) * tempLine.getDistance(this.points[2]);
                    Show_area(area, areaAll - area);
                }
            }
        } else if (num1 + num2 + num3 == 3) {
            if (temp1.equal(temp2)) {
                Line tempLine = new Line(temp1, temp3);
                double area = 0.5 * temp1.distance(temp3) * tempLine.getDistance(this.points[0]);
                Show_area(area, areaAll - area);
            } else if (temp1.equal(temp3)) {
                Line tempLine = new Line(temp2, temp3);
                double area = 0.5 * temp3.distance(temp2) * tempLine.getDistance(this.points[3]);
                Show_area(area, areaAll - area);
            } else if (temp2.equal(temp3)) {
                Line tempLine = new Line(temp1, temp2);
                double area = 0.5 * temp1.distance(temp2) * tempLine.getDistance(this.points[2]);
                Show_area(area, areaAll - area);
            }
        } else {
            System.out.println(num1 + num2 + num3);
        }
    }


    @Override
    public int IsInThePolygon(Point p) {
        Point temp1 = new Point();
        Point temp2 = new Point();
        Line l = new Line();
        l.p1 = p;
        l.a = this.lines[0].a;
        l.b = this.lines[0].b;
        l.c = -l.a * l.p1.x - l.b * l.p1.y;
        temp1 = l.InterSection(this.lines[1]);
        temp2 = l.InterSection(this.lines[2]);
        l.p1 = temp1;
        l.p2 = temp2;
        int temp = 0;
        if ((this.lines[0].getDistance(p) == 0 && lines[0].IsMid(p)) || (this.lines[2].getDistance(p) == 0 && lines[2].IsMid(p)) || (lines[2].IsMid(p) && this.lines[2].getDistance(p) == 0)) {
            //System.out.println("on the triangle");
            return 0;
        }
//        if ((this.lines[0].getDistance(p) == 0 && !lines[0].IsMid(p)) || (this.l2.getDistance(p) == 0 && !l2.IsMid(p)) || (!l3.IsMid(p) && this.l3.getDistance(p) == 0)) {
//            System.out.println("outof the triangle");
//            return;
//        }
//        if (temp1.equal(temp2)) {
//            System.out.println("outof the triangle");
//            return;
//        }
//        if (!this.l2.IsMid(temp1) || !this.l3.IsMid(temp2)) {
//            System.out.println("outof the triangle");
//            return;
//        }
        if (this.lines[1].IsMid(temp1) && this.lines[2].IsMid(temp2)) {
            if (l.IsMid(p)) {
                temp++;
            }
        }
        if (temp == 0) {
//            System.out.println("in the triangle");
            return 1;
        } else {
//            System.out.println("outof the triangle");
            return -1;
        }
    }
}

class Quadrilateral extends Polygon {

    Quadrilateral() {
    }

    Quadrilateral(Point[] points, int num) {
        super(points, num);
    }

    @Override
    public boolean IsPolygon() {
        if (this.lines[0].isParallel(this.lines[1]) || this.lines[0].isParallel(this.lines[3]) || this.lines[2].isParallel(this.lines[1]) || this.lines[2].isParallel(this.lines[3])) {
            return false;
        }

        Point p0 = this.lines[0].InterSection(this.lines[2]);
        Point p5 = this.lines[1].InterSection(this.lines[3]);
        if (p0 != null && (this.lines[0].IsMid(p0) && this.lines[2].IsMid(p0)) || p5 != null && (this.lines[1].IsMid(p5) && this.lines[3].IsMid(p5))) {
            return false;
        }
        return true;
    }

    //是否为平行四边形
    public boolean isParallelQuadrilateral() {
        return this.lines[0].isParallel(this.lines[2]) && this.lines[1].isParallel(this.lines[3]);
    }

    //是否为菱形
    public boolean isDiamond() {
        boolean flag = this.lines[1].length == this.lines[0].length && this.lines[1].length == this.lines[2].length && this.lines[2].length == this.lines[3].length;
        return this.isParallelQuadrilateral() && flag;
    }

    //是否为矩形
    public boolean isRectangle() {
        return this.points[0].distance(this.points[2]) == this.points[1].distance(this.points[3]);
    }

    //是否为正方形
    public boolean isSquare() {
        return this.isDiamond() && this.isRectangle();
    }

    //是否为凸四边形
    public boolean isConvexQuadrilateral() {
        double[] s = new double[4];
        s[0] = Triangle.area(this.points[0], this.points[1], this.points[2]);
        s[1] = Triangle.area(this.points[1], this.points[2], this.points[3]);
        s[2] = Triangle.area(this.points[0], this.points[1], this.points[3]);
        s[3] = Triangle.area(this.points[0], this.points[2], this.points[3]);
        return Math.abs(s[0] + s[1] - s[2] - s[3]) < 0.0001;
    }

    //四边形周长
    public double sideLength() {
        return this.lines[0].length + this.lines[1].length + this.lines[2].length + this.lines[3].length;
    }

    //四边形面积
    public double area() {
        double[] s = new double[4];
        s[0] = Triangle.area(this.points[0], this.points[1], this.points[2]);
        s[1] = Triangle.area(this.points[0], this.points[2], this.points[3]);

        s[2] = Triangle.area(this.points[0], this.points[1], this.points[3]);
        s[3] = Triangle.area(this.points[1], this.points[2], this.points[3]);

        return Math.min(s[0] + s[1], s[2] + s[3]);
    }

    //线切割四边形
    @Override
    public void Intersection(Line l) {
        int num1 = 0;
        int num2 = 0;
        int num3 = 0;
        int num4 = 0;
        Point temp1;
        Point temp2;
        Point temp3;
        Point temp4;
        temp1 = l.InterSection(this.lines[0]);
        temp2 = l.InterSection(this.lines[1]);
        temp3 = l.InterSection(this.lines[2]);
        temp4 = l.InterSection(this.lines[3]);
        if (l.IsSame(this.lines[0]) || l.IsSame(this.lines[1]) || l.IsSame(this.lines[2]) || l.IsSame(this.lines[3])) {
            System.out.println("The line is coincide with one of the lines");
            return;
        }
        if (this.lines[0].IsMid(temp1)) {
            num1++;
        }
        if (this.lines[1].IsMid(temp2)) {
            num2++;
        }
        if (this.lines[2].IsMid(temp3)) {
            num3++;
        }
        if (this.lines[3].IsMid(temp4)) {
            num4++;
        }
        int sum = num1 + num2 + num3 + num4;
        double areaAll = area();
        if (sum == 2) {
            if (num1 == 1 && num2 == 1) {
                if (temp1.equal(temp2)) {
                    System.out.println("1");
                } else {
                    Line tempLine = new Line(temp1, temp2);
                    double area = 0.5 * temp1.distance(temp2) * tempLine.getDistance(this.points[1]);
                    Show_area(area, areaAll - area);
                }
            } else if (num1 == 1 && num3 == 1) {
                Line tempLine = new Line(temp1, temp3);
                Point[] point = {temp1, temp3, this.points[2], this.points[1]};
                Quadrilateral q = new Quadrilateral(point, 4);
                double area = q.area();
                Show_area(area, areaAll - area);
            } else if (num1 == 1 && num4 == 1) {
                if (temp1.equal(temp4)) {
                    System.out.println("1");
                } else {
                    Line tempLine = new Line(temp1, temp4);
                    //Quadrilateral q = new Quadrilateral(temp1, temp3, this.points[1], this.points[2]);
                    double area = 0.5 * temp1.distance(temp4) * tempLine.getDistance(this.points[0]);
                    Show_area(area, areaAll - area);
                }
            } else if (num2 == 1 && num3 == 1) {
                if (temp2.equal(temp3)) {
                    System.out.println("1");
                } else {
                    Line tempLine = new Line(temp2, temp3);
                    //Quadrilateral q = new Quadrilateral(temp1, temp3, this.points[1], this.points[2]);
                    double area = 0.5 * temp2.distance(temp3) * tempLine.getDistance(this.points[2]);
                    Show_area(area, areaAll - area);
                }
            } else if (num2 == 1 && num4 == 1) {
                Line tempLine = new Line(temp2, temp4);
                Point[] point = {temp2, temp4, this.points[0], this.points[1]};
                Quadrilateral q = new Quadrilateral(point, 4);
                double area = q.area();
                Show_area(area, areaAll - area);
            } else if (num3 == 1 && num4 == 1) {
                if (temp3.equal(temp4)) {
                    System.out.println("1");
                } else {
                    Line tempLine = new Line(temp3, temp4);
                    //Quadrilateral q = new Quadrilateral(temp2, temp4, this.points[0], this.points[1]);
                    double area = 0.5 * temp3.distance(temp4) * tempLine.getDistance(this.points[3]);
                    Show_area(area, areaAll - area);
                }
            }
        } else if (sum == 3) {
            if (num1 == 1 && num2 == 1 && num3 == 1) {
                if (temp1.equal(temp2)) {
                    Line tempLine = new Line(temp1, temp3);
                    double area = 0.5 * tempLine.getDistance(this.points[2]) * tempLine.length;
                    Show_area(area, areaAll - area);
                } else if (temp2.equal(temp3)) {
                    Line tempLine = new Line(temp1, temp2);
                    double area = 0.5 * tempLine.getDistance(this.points[1]) * tempLine.length;
                    Show_area(area, areaAll - area);
                }
            } else if (num1 == 1 && num2 == 1 && num4 == 1) {
                if (temp1.equal(temp2)) {
                    Line tempLine = new Line(temp1, temp4);
                    double area = 0.5 * tempLine.getDistance(this.points[0]) * tempLine.length;
                    Show_area(area, areaAll - area);
                } else if (temp1.equal(temp4)) {
                    Line tempLine = new Line(temp1, temp2);
                    double area = 0.5 * tempLine.getDistance(this.points[1]) * tempLine.length;
                    Show_area(area, areaAll - area);
                }
            } else if (num1 == 1 && num3 == 1 && num4 == 1) {
                if (temp1.equal(temp4)) {
                    Line tempLine = new Line(temp1, temp2);
                    double area = 0.5 * tempLine.getDistance(this.points[1]) * tempLine.length;
                    Show_area(area, areaAll - area);
                } else if (temp3.equal(temp4)) {
                    Line tempLine = new Line(temp1, temp4);
                    double area = 0.5 * tempLine.length * tempLine.getDistance(this.points[0]);
                    Show_area(area, areaAll - area);
                }
            } else if (num2 == 1 && num3 == 1 && num4 == 1) {
                if (temp2.equal(temp3)) {
                    Line tempLine = new Line(temp2, temp4);
                    double area = 0.5 * tempLine.length * tempLine.getDistance(this.points[3]);
                    Show_area(area, areaAll - area);
                } else if (temp3.equal(temp4)) {
                    Line tempLine = new Line(temp2, temp3);
                    double area = 0.5 * tempLine.length * tempLine.getDistance(this.points[2]);
                    Show_area(area, areaAll - area);
                }
            }
        } else if (sum == 4) {
            if (this.isConvexQuadrilateral()) {
                if (temp1.equal(temp2) && temp3.equal(temp4)) {
                    Line tempLine = new Line(temp1, temp3);
                    double area = 0.5 * tempLine.length * tempLine.getDistance(this.points[0]);
                    Show_area(area, areaAll - area);
                } else if (temp1.equal(temp4) && temp3.equal(temp2)) {
                    Line tempLine = new Line(temp1, temp2);
                    double area = 0.5 * tempLine.length * tempLine.getDistance(this.points[1]);
                    Show_area(area, areaAll - area);
                }
            } else {
                Line tempLine1 = new Line(this.points[0], this.points[2]);
                Line tempLine2 = new Line(this.points[1], this.points[3]);
                if (tempLine1.The_same_side(this.points[1], this.points[3])) {

                } else if (tempLine2.The_same_side(this.points[0], this.points[3])) {

                }

            }
        } else {
            System.out.println(sum);
        }
    }

    //点是否在四边形内
    @Override
    public int IsInThePolygon(Point p) {
        Point temp1 = null;
        Point temp2 = null;
        Point temp3 = null;
        Line l = new Line();
        l.p1 = p;
        l.a = this.lines[0].a;
        l.b = this.lines[0].b;
        l.c = -l.a * l.p1.x - l.b * l.p1.y;
        temp1 = l.InterSection(this.lines[1]);
        temp2 = l.InterSection(this.lines[2]);
        temp3 = l.InterSection(this.lines[3]);
        int temp = 0;
        if ((this.lines[0].getDistance(p) == 0 && this.lines[0].IsMid(p)) || (this.lines[1].getDistance(p) == 0 && this.lines[1].IsMid(p)) || (this.lines[2].getDistance(p) == 0 && this.lines[2].IsMid(p)) || (this.lines[3].getDistance(p) == 0 && this.lines[3].IsMid(p))) {
            System.out.println("on the quadrilateral");
            return 0;
        }
//        if ((this.lines[0].getDistance(p) == 0 && !this.lines[0].IsMid(p)) || (this.lines[1].getDistance(p) == 0 && !this.lines[1].IsMid(p)) || (this.lines[2].getDistance(p) == 0 && !this.lines[2].IsMid(p)) || (this.lines[3].getDistance(p) == 0 && !this.lines[3].IsMid(p))) {
//            System.out.println("outof the quadrilateral");
//            return;
//        }
//        if (temp1.equal(temp2) || temp2.equal(temp3)) {
//            System.out.println("outof the quadrilateral");
//            return;
//        }
        if ((this.lines[1].IsMid(temp1) && this.lines[2].IsMid(temp2))) {
            l.p2 = temp2;
            l.p1 = temp1;
            if (l.IsMid(p)) {
//                System.out.println("in the quadrilateral");
//                return 1;
                temp++;
            }
        }
        if (this.lines[1].IsMid(temp1) && this.lines[3].IsMid(temp3)) {
            l.p2 = temp3;
            l.p1 = temp1;
            if (l.IsMid(p)) {
//                System.out.println("in the quadrilateral");
//                return;
                temp++;
            }
        }
        if (this.lines[3].IsMid(temp3) && this.lines[2].IsMid(temp2)) {
            l.p2 = temp3;
            l.p1 = temp2;
            if (l.IsMid(p)) {
//                System.out.println("in the quadrilateral");
//                return;
                temp++;
            }
        }
        if (temp == 0) {
            return -1;
        } else {
            return 1;
        }
    }
}

class Pentagon extends Polygon {

    Pentagon() {
    }

    Pentagon(Point[] parr, int num) {
        super(parr, num);
    }

    @Override
    public boolean IsPolygon() {
        if (lines[0].isParallel(lines[1]) || lines[1].isParallel(lines[2]) || lines[2].isParallel(lines[3]) || lines[3].isParallel(lines[4]) || lines[4].isParallel(lines[0])) {
            return false;
        }

        Point[] p = new Point[5];
        if (!lines[0].isParallel(lines[2])) {
            p[0] = lines[0].InterSection(lines[2]);
        }
        if (!lines[0].isParallel(lines[3])) {
            p[1] = lines[1].InterSection(lines[3]);
        }
        if (!lines[1].isParallel(lines[3])) {
            p[2] = lines[1].InterSection(lines[3]);
        }
        if (!lines[1].isParallel(lines[4])) {
            p[3] = lines[1].InterSection(lines[4]);
        }
        if (!lines[2].isParallel(lines[4])) {
            p[4] = lines[2].InterSection(lines[4]);
        }

        if ((p[0] != null && lines[0].IsMid(p[0]) && lines[2].IsMid(p[0]))
                || (p[1] != null && lines[0].IsMid(p[1]) && lines[3].IsMid(p[1]))
                || (p[2] != null && lines[1].IsMid(p[2]) && lines[3].IsMid(p[2]))
                || (p[3] != null && lines[1].IsMid(p[3]) && lines[4].IsMid(p[3]))
                || (p[4] != null && lines[2].IsMid(p[4]) && lines[4].IsMid(p[4]))) {
            return false;
        }

        return true;
    }

    @Override
    public int IsInThePolygon(Point p) {
        return 0;
    }

    @Override
    public void Intersection(Line l) {
        int num1 = 0;
        int num2 = 0;
        int num3 = 0;
        int num4 = 0;
        int num5 = 0;
        Point temp1 = null;
        Point temp2 = null;
        Point temp3 = null;
        Point temp4 = null;
        Point temp5 = null;
        if (l.IsSame(lines[0]) || l.IsSame(lines[1]) || l.IsSame(lines[2]) || l.IsSame(lines[3]) || l.IsSame(lines[4])) {
            System.out.println("The line is coincide with one of the lines");
            return;
        }
        if (!l.isParallel(lines[0])) {
            temp1 = l.InterSection(lines[0]);
        }
        if (!l.isParallel(lines[1])) {
            temp2 = l.InterSection(lines[1]);
        }
        if (!l.isParallel(lines[2])) {
            temp3 = l.InterSection(lines[2]);
        }
        if (!l.isParallel(lines[3])) {
            temp4 = l.InterSection(lines[3]);
        }
        if (!l.isParallel(lines[4])) {
            temp5 = l.InterSection(lines[4]);
        }

        if (temp1 != null && lines[0].IsMid(temp1)) {
            num1++;
        }
        if (temp2 != null && lines[1].IsMid(temp2)) {
            num2++;
        }
        if (temp3 != null && lines[2].IsMid(temp3)) {
            num3++;
        }
        if (temp4 != null && lines[3].IsMid(temp4)) {
            num4++;
        }
        if (temp5 != null && lines[4].IsMid(temp5)) {
            num5++;
        }
        int sum = num1 + num2 + num3 + num4 + num5;
        double areaAll = this.getArea();
        double area = 0;
        if (sum == 2) {
            if (num1 == 1 && num2 == 1) {
                if (temp1.equal(temp2)) {
                    System.out.println("1");
                    System.exit(0);
                }
                Line tempLine = new Line(temp1, temp2);
                area = 0.5 * temp1.distance(temp2) * tempLine.getDistance(points[1]);
                Show_area(area, areaAll - area);
            } else if (num1 == 1 && num3 == 1) {
                Line tempLine = new Line(temp1, temp3);
                Point[] point = {temp1, temp3, this.points[2], this.points[1]};
                Quadrilateral q = new Quadrilateral(point, 4);
                area = q.getArea();
                Show_area(area, areaAll - area);
            } else if (num1 == 1 && num4 == 1) {
                Line tempLine = new Line(temp1, temp4);
                Point[] point = {temp1, temp4, this.points[4], this.points[0]};
                Quadrilateral q = new Quadrilateral(point, 4);
                area = q.getArea();
                Show_area(area, areaAll - area);
            } else if (num1 == 1 && num5 == 1) {
                if (temp1.equal(temp5)) {
                    System.out.println("1");
                    System.exit(0);
                }
                Line tempLine = new Line(temp1, temp5);
                area = 0.5 * temp1.distance(temp5) * tempLine.getDistance(points[0]);
                Show_area(area, areaAll - area);
            } else if (num2 == 1 && num3 == 1) {
                if (temp2.equal(temp3)) {
                    System.out.println("1");
                    System.exit(0);
                }
                Line tempLine = new Line(temp2, temp3);
                area = 0.5 * temp2.distance(temp3) * tempLine.getDistance(points[2]);
            } else if (num2 == 1 && num4 == 1) {
                Point[] point = {temp2, temp4, points[3], points[2]};
                Quadrilateral q = new Quadrilateral(point, 4);
                area = q.getArea();
            } else if (num2 == 1 && num5 == 1) {
                Point[] point = {temp2, temp5, points[0], points[1]};
                Quadrilateral q = new Quadrilateral(point, 4);
                area = q.getArea();
            } else if (num3 == 1 && num4 == 1) {
                if (temp3.equal(temp4)) {
                    System.out.println("1");
                    System.exit(0);
                }
                Line tempLine = new Line(temp3, temp4);
                area = 0.5 * temp3.distance(temp4) * tempLine.getDistance(points[3]);
            } else if (num3 == 1 && num5 == 1) {
                Point[] point = {temp3, temp5, points[4], points[3]};
                Quadrilateral q = new Quadrilateral(point, 4);
                area = q.getArea();
            } else if (num4 == 1 && num5 == 1) {
                if (temp5.equal(temp4)) {
                    System.out.println("1");
                    System.exit(0);
                }
                Line tempLine = new Line(temp4, temp5);
                area = 0.5 * temp5.distance(temp4) * tempLine.getDistance(points[4]);
            }
        } else if (sum == 3) {
            if (num1 == 1 && num5 == 1) {
                if (num2 == 1) {
                    Line tempLine = new Line(temp1, temp2);
                    area = 0.5 * temp1.distance(temp2) * tempLine.getDistance(points[1]);
                } else if (num3 == 1) {
                    Point[] point = {temp1, temp3, points[2], points[1]};
                    Quadrilateral q = new Quadrilateral(point, 4);
                    area = q.getArea();
                } else if (num4 == 1) {
                    Line tempLine = new Line(temp1, temp4);
                    area = 0.5 * temp1.distance(temp4) * tempLine.getDistance(points[4]);
                }
            } else if (num1 == 1 && num2 == 1) {
                if (num3 == 1) {
                    Line tempLine = new Line(temp2, temp3);
                    area = 0.5 * temp2.distance(temp3) * tempLine.getDistance(points[2]);
                } else if (num4 == 1) {
                    Point[] point = {temp2, temp4, points[3], points[2]};
                    Quadrilateral q = new Quadrilateral(point, 4);
                    area = q.getArea();
                } else if (num5 == 1) {
                    Line tempLine = new Line(temp2, temp5);
                    area = 0.5 * temp2.distance(temp5) * tempLine.getDistance(points[0]);
                }
            } else if (num2 == 1 && num3 == 1) {
                if (num1 == 1) {
                    Line tempLine = new Line(temp1, temp3);
                    area = 0.5 * temp1.distance(temp3) * tempLine.getDistance(points[1]);
                } else if (num4 == 1) {
                    Line tempLine = new Line(temp4, temp3);
                    area = 0.5 * temp3.distance(temp4) * tempLine.getDistance(points[3]);
                } else if (num5 == 1) {
                    Point[] point = {temp3, temp5, points[4], points[3]};
                }
            } else if (num3 == 1 && num4 == 1) {
                if (num1 == 1) {
                    Point[] point = {temp4, temp1, points[1], points[2]};
                    Quadrilateral q = new Quadrilateral(point, 4);
                    area = q.getArea();
                } else if (num2 == 1) {
                    Line tempLine = new Line(temp4, temp2);
                    area = 0.5 * tempLine.length * tempLine.getDistance(points[2]);
                } else if (num5 == 1) {
                    Line tempLine = new Line(temp4, temp5);
                    area = 0.5 * tempLine.length * tempLine.getDistance(points[4]);
                }
            } else if (num4 == 1 && num5 == 1) {
                if (num1 == 1) {
                    Line tempLine = new Line(temp5, temp1);
                    area = 0.5 * tempLine.length * tempLine.getDistance(points[0]);
                } else if (num2 == 1) {
                    Point[] point = {temp5, temp2, points[1], points[0]};
                    Quadrilateral q = new Quadrilateral(point, 4);
                    area = q.getArea();
                } else if (num3 == 1) {
                    Line tempLine = new Line(temp5, temp3);
                    area = 0.5 * tempLine.length * tempLine.getDistance(points[3]);
                }
            }
        } else if (sum == 4) {
            if (num1 == 1 && num5 == 1) {
                if (num2 == 1 && num3 == 1) {
                    Line tempLine = new Line(temp1, temp2);
                    area = 0.5 * tempLine.length * tempLine.getDistance(points[1]);
                } else if (num3 == 1 && num4 == 1) {
                    Line tempLine = new Line(temp1, temp3);
                    area = 0.5 * tempLine.length * tempLine.getDistance(points[4]);
                }
            } else if (num1 == 1 && num2 == 1) {
                if (num3 == 1 && num4 == 1) {
                    Line tempLine = new Line(temp1, temp3);
                    area = 0.5 * tempLine.length * tempLine.getDistance(points[2]);
                } else if (num4 == 1 && num5 == 1) {
                    Line tempLine = new Line(temp1, temp4);
                    area = 0.5 * tempLine.length * tempLine.getDistance(points[0]);
                }
            } else if (num2 == 1 && num3 == 1) {
                if (num4 == 1 && num5 == 1) {
                    Line tempLine = new Line(temp2,temp4);
                    area = 0.5*tempLine.length*tempLine.getDistance(points[3]);
                }
            }
        } else {
            System.out.println(sum);
            return;
        }
        Show_area(area, areaAll - area);
    }
}

abstract class Polygon {
    public Point[] points;
    public Line[] lines;
    public int SideNumber;

    public Polygon() {

    }

    public Polygon(Point[] points, int num) {
        this.points = points;
        this.SideNumber = num;
        lines = new Line[num];
        for (int i = 0; i < SideNumber; i++) {
            lines[i] = new Line(points[i % SideNumber], points[(i + 1) % SideNumber]);
        }
    }

    public Point[] getPoints() {
        return points;
    }

    public void setPoints(Point[] points) {
        this.points = points;
    }

    public Line[] getLines() {
        return lines;
    }

    public void setLines(Line[] lines) {
        this.lines = lines;
    }

    public double getArea() {
        double s = 0;
        for (int i = 0; i < SideNumber; i++) {
            s += points[i % SideNumber].x * points[(i + 1) % SideNumber].y - points[i % SideNumber].y * points[(i + 1) % SideNumber].x;
        }
        return s * 0.5;
    }

    public double getArea(Point[] points) {
        double s = 0;
        for (int i = 0; i < points.length; i++) {
            s += points[i % points.length].x * points[(i + 1) % points.length].y - points[i % points.length].y * points[(i + 1) % points.length].x;
        }
        return s * 0.5;
    }

    public abstract boolean IsPolygon();

    //四边形周长
    public double sideLength() {
        double s = 0;
        for (int i = 0; i < SideNumber; i++) {
            s += lines[i].length;
        }
        return s;
    }

    public abstract int IsInThePolygon(Point p);

    public void Show(double num){
        System.out.println(new DecimalFormat("0.0#####").format(num));
    }

    public void Show_area(double area1, double area2) {
        if (area1 > area2) {
            System.out.println("2 " + new DecimalFormat("0.0#####").format(area2) + " " + new DecimalFormat("0.0#####").format(area1));
        } else {
            System.out.println("2 " + new DecimalFormat("0.0#####").format(area1) + " " + new DecimalFormat("0.0#####").format(area2));
        }
    }

    //线切割多边形
    public abstract void Intersection(Line l);

    public boolean isConvexPolygon() {
        while (true) {
            //凸多边形
            boolean tag = true;
            int j, k, t;
            for (int i = 0; i < SideNumber; i++) {
                //k,t直接对n求余就行了
                j = i;
                k = i + 1;
                t = i + 2;
                //以三角形为例看看
                if (k == SideNumber) {
                    k = 0;
                }
                if (t == SideNumber + 1) {
                    t = 1;
                }
                if (t == SideNumber) {
                    t = 0;
                }
                //注意是后面减去前面的
                Point p1 = new Point(points[k].x - points[j].x, points[k].y - points[j].y);
                Point p2 = new Point(points[t].x - points[k].x, points[t].y - points[k].y);
                //叉积
                double ans = p1.x * p2.y - p1.y * p2.x;
                if (ans < 0) {
                    return false;
                }
            }
            if (tag) {
                return true;
            } else {
                return false;
            }
        }
    }

}

这次使用了抽象类，但方法大多数是抽象方法，需要重写。

题目集5（7-2）

用户输入一组选项和数据，进行与五边形有关的计算。
以下五边形顶点的坐标要求按顺序依次输入，连续输入的两个顶点是相邻顶点，第一个和最后一个输入的顶点相邻。
选项包括：
4：输入十个点坐标，前、后五个点分别构成一个凸多边形（三角形、四边形、五边形），判断它们两个之间是否存在包含关系（一个多边形有一条或多条边与另一个多边形重合，其他部分都包含在另一个多边形内部，也算包含）。
两者存在六种关系：1、分离（完全无重合点） 2、连接（只有一个点或一条边重合） 3、完全重合 4、被包含（前一个多边形在后一个多边形的内部）5、交错 6、包含（后一个多边形在前一个多边形的内部）。
各种关系的输出格式如下：
1、no overlapping area between the previous triangle/quadrilateral/ pentagon and the following triangle/quadrilateral/ pentagon
2、the previous triangle/quadrilateral/ pentagon is connected to the following triangle/quadrilateral/ pentagon
3、the previous triangle/quadrilateral/ pentagon coincides with the following triangle/quadrilateral/ pentagon
4、the previous triangle/quadrilateral/ pentagon is inside the following triangle/quadrilateral/ pentagon
5、the previous triangle/quadrilateral/ pentagon is interlaced with the following triangle/quadrilateral/ pentagon
6、the previous triangle/quadrilateral/ pentagon contains the following triangle/quadrilateral/ pentagon

5：输入十个点坐标，前、后五个点分别构成一个凸多边形（三角形、四边形、五边形），输出两个多边形公共区域的面积。注：只考虑每个多边形被另一个多边形分割成最多两个部分的情况，不考虑一个多边形将另一个分割成超过两个区域的情况。
6：输入六个点坐标，输出第一个是否在后五个点所构成的多边形（限定为凸多边形，不考虑凹多边形），的内部（若是五边形输出in the pentagon/outof the pentagon，若是四边形输出in the quadrilateral/outof the quadrilateral，若是三角形输出in the triangle/outof the triangle）。输入入错存在冗余点要排除，冗余点的判定方法见选项5。如果点在多边形的某条边上，输出"on the triangle/on the quadrilateral/on the pentagon"。
以上4、5、6选项输入的五个点坐标可能存在冗余，假设多边形一条边上两个端点分别是x、y，边线中间有一点z，另一顶点s：
1）符合要求的输入：顶点重复或者z与xy都相邻，如：x x y s、x z y s、x y x s、s x y y。此时去除冗余点，保留一个x、一个y。
2) 不符合要求的输入：z不与xy都相邻，如：z x y s、x z s y、x s z y

输入格式:

基本格式：选项+":"+坐标x+","+坐标y+" "+坐标x+","+坐标y。点的x、y坐标之间以英文","分隔，点与点之间以一个英文空格分隔。

输出格式:

输出的数据若小数点后超过3位，只保留小数点后3位，多余部分采用四舍五入规则进到最低位。小数点后若不足3位，按原始位数显示，不必补齐。例如：1/3的结果按格式输出为 0.333，1.0按格式输出为1.0

输入样例:

在这里给出一组输入。例如：

4:0,0 6,0 7,1 8,3 6,6 0,0 6,0 7,1 8,3 6,6

 

输出样例:

在这里给出相应的输出。例如：

the previous pentagon coincides with the following pentagon


SourceMonito报表

 类图：

完整代码：

import java.text.DecimalFormat;
import java.util.Scanner;
import java.util.Arrays;
import java.util.Comparator;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        String s2[] = null;
        String s1[] = null;
        String s3[] = null;
        String s4 = "";
        double[] d = new double[30];

        if (!s.matches("^[1-6]:(([+-]?(0|(0\\.\\d+)|[1-9]\\d*(\\.\\d+)?)),([+-]?(0|(0\\.\\d+)|[1-9]\\d*(\\.\\d+)?))\\s?)+$")) {
            System.out.println("Wrong Format");
            System.exit(0);
        }
        int index = 0;
        s3 = s.split(":");
        s1 = s3[1].split(" ");
        for (int i = 0; i < s1.length; i++) {
            s2 = s1[i].split(",");
            for (int j = 0; j < s2.length; j++) {
                if (!check(s2[j])) {
                    System.out.println("Wrong Format");
                    System.exit(0);
                }
                d[index++] = Double.valueOf(s2[j]);
            }
        }

        int num = 0;
        Point[] parr = new Point[10];
        for (int i = 0; i < index; i++) {
            if (i % 2 == 0) {
                parr[num++] = new Point(d[i], d[i + 1]);
            }
        }
        pointsCntCheck(s.charAt(0) - '0', index);
        switch (s.charAt(0)) {
            case '4':
                Polygon p1 = new Polygon(new Point[]{parr[0], parr[1], parr[2], parr[3], parr[4]});
                Polygon p2 = new Polygon(new Point[]{parr[5], parr[6], parr[7], parr[8], parr[9]});
                System.out.println(p1.relationshipWith(p2));
//                 String[] name1 = new String[]{"triangle", "quadrilateral", "pentagon"};
//                 System.out.println("no overlapping area between the previous " + name1[0] + " and the following " + name1[0]);
                break;
            case '5':
                Polygon p3 = new Polygon(new Point[]{parr[0], parr[1], parr[2], parr[3], parr[4]});
                Polygon p4 = new Polygon(new Point[]{parr[5], parr[6], parr[7], parr[8], parr[9]});
                System.out.println(new DecimalFormat("0.0##").format(p3.overlappingArea(p4)));
                break;
            case '6':
                Polygon p = new Polygon(new Point[]{parr[1], parr[2], parr[3], parr[4], parr[5]});
                int res = p.IsInThePolygon(parr[0]);
                String[] name = {"triangle", "quadrilateral", "pentagon"};
                if (res == -1) {
                    System.out.println("outof the " + name[p.len - 3]);
                } else if (res == 0) {
                    System.out.println("on the " + name[p.len - 3]);
                } else if (res == 1) {
                    System.out.println("in the " + name[p.len - 3]);
                }
                break;
        }
    }

    public static boolean check(String str) {
        return str.matches("^[+-]?(0|(0\\.\\d+)?|[1-9]\\d*(\\.\\d+)?)$");
    }

    public static void pointsCntCheck(int cmd, int cnt) {
        if (cmd == 4 || cmd == 5) {
            if (cnt != 20) {
                System.out.println("wrong number of points");
                System.exit(0);
            }
        }
        if (cmd == 6) {
            if (cnt != 12) {
                System.out.println("wrong number of points");
                System.exit(0);
            }
        }
    }
}

class Point {
    double x, y;

    Point() {
    }

    Point(double x, double y) {
        this.x = x;
        this.y = y;
    }

    double distance(Point p) {
        return Math.sqrt(Math.pow(this.x - p.x, 2) + Math.pow(this.y - p.y, 2));
    }

    boolean equal(Point p) {
        if (this.x == p.x && this.y == p.y) {
            return true;
        } else {
            return false;
        }
    }

    public Point deepCopy(){
        Point res = new Point();
        res.x = this.x;
        res.y = this.y;
        return res;
    }

    public Point add(Point another){
        Point res = this.deepCopy();
        res.x += another.x;
        res.y += another.y;
        return res;
    }

    public Point sub(Point another){
        Point res = this.deepCopy();
        res.x -= another.x;
        res.y -= another.y;
        return res;
    }

    //求点集重心
    public static Point focusPoint(Point[] points ){
        Point res = new Point(0,0);
        for(Point item:points){
            res = res.add(item);
        }
        res.x /= points.length;
        res.y /= points.length;
        return res;
    }
}

class Line {
    Point p1, p2;
    double a, b, c;
    double length;
    private Point vector;

    Line() {
    }

    Line(Point p1, Point p2) {
        this.p1 = p1;
        this.p2 = p2;
        this.a = p2.y - p1.y;
        this.b = p1.x - p2.x;
        this.c = p2.x * p1.y - p1.x * p2.y;
        this.length = p1.distance(p2);
        this.vector = p2.sub(p1);
    }

    public double getSlope() {
        if (b == 0) {
            return 9999;
        } else {
            return -a / b;
        }
    }

    public double getDistance(Point p) {
        return Math.abs(this.a * p.x + this.b * p.y + c) / Math.sqrt(Math.pow(this.a, 2) + Math.pow(this.b, 2));
    }

    public boolean isParallel(Line l) {
        if (this.getSlope() == l.getSlope())
            return true;
        else
            return false;
    }

    public boolean IsSame(Line l) {
        if (this.getSlope() == l.getSlope() && this.getDistance(l.p1) == 0)
            return true;
        else
            return false;
    }

    //判断是否在直线之上
    public boolean inLine(Point p) {
        return Math.abs(this.a * p.x + this.b * p.y + this.c) < 0.000001;
    }

    //包含端点
    public boolean IsMid(Point p) {
        if (!this.inLine(p)) return false;
        double res = p.distance(this.p1) + p.distance(this.p2) - this.getLength();
        return Math.abs(res) < 0.000001;
    }

    public double getLength() {
        this.length = this.p1.distance(this.p2);
        return this.length;
    }

    public Point getIntersection(Line l) {
        if (this.isParallel(l)) {
            return null;
        }
        double temp = this.a * l.b - l.a * this.b;
        double x = (this.b * l.c - l.b * this.c) / temp;
        double y = (l.a * this.c - this.a * l.c) / temp;
        Point p = new Point(x, y);
        return p;
    }

    //获取线段交点
    public Point LineSegmentIntersection(Line another){
        Point res = this.getIntersection(another);
        if(res == null) return res;
        boolean ok = (this.IsMid(res) && another.IsMid(res));
        return ok ? res:null;
    }

    //判断是否垂直
    public boolean isVerticalTo(Line another) {
        return this.a * another.a + this.b * another.b == 0;
    }

    //求向量模
    public double vectorLength() {
        return Math.sqrt(Math.pow(this.vector.x, 2) + Math.pow(this.vector.y, 2));
    }

    //求向量点积
    public double vectorMul(Line another) {
        return (this.vector.x * another.vector.x) + (this.vector.y * another.vector.y);
    }

    //求向量叉积
    public double vectorCrossMul(Line another) {
        return (this.vector.x * another.vector.y) - (another.vector.x * this.vector.y);
    }

    //求两向量夹角(非0向量)
    public double vectorAngle(Line another) {
        double cos_angle = this.vectorMul(another) / (this.vectorLength() * another.vectorLength());
        return Math.acos(cos_angle);
    }
}

class Triangle extends Polygon {

    public Triangle() {
    }

    public Triangle(Point[] points) {
        super(points);
        if (this.status == -1 || this.len != 3) {
            System.out.println("not a triangle");
            System.exit(0);
        }
    }

    //求三个点围成的图形面积（三点可能共线，面积为0）
    public static double area(Point a, Point b, Point c) {
        double len1 = a.distance(b);
        double len2 = b.distance(c);
        double len3 = c.distance(a);
        double p = (len1 + len2 + len3) / 2;
        return Math.sqrt(p * (p - len1) * (p - len2) * (p - len3));
    }
}

class Quadrilateral extends Polygon {

    Quadrilateral() {
    }

    public Quadrilateral(Point[] points) {
        super(points);
        if (this.status == -1 || this.len != 4) {
            System.out.println("not a quadrilateral");
            System.exit(0);
        }
    }

    //是否为平行四边形
    public boolean isParallelQuadrilateral() {
        return this.lines[0].isParallel(this.lines[2]) && this.lines[1].isParallel(this.lines[3]);
    }

    //是否为菱形
    public boolean isDiamond() {
        boolean flag = this.lines[1].length == this.lines[0].length && this.lines[1].length == this.lines[2].length && this.lines[2].length == this.lines[3].length;
        return this.isParallelQuadrilateral() && flag;
    }

    //是否为矩形
    public boolean isRectangle() {
        return this.points[0].distance(this.points[2]) == this.points[1].distance(this.points[3]);
    }

    //是否为正方形
    public boolean isSquare() {
        return this.isDiamond() && this.isRectangle();
    }
}

class Pentagon extends Polygon {

    public Pentagon() {
    }

    public Pentagon(Point[] parr) {
        super(parr);
        if (this.status == -1 || this.len != 5) {
            System.out.println("not a pentagon");
            System.exit(0);
        }
    }
}

class Polygon {
    public int len = 0, status = 1;
    public Point[] points;
    public Line[] lines;
    public boolean isConvexGraphical = true;
    public double sideLength = 0, area = 0;   //边长,面积

    public Polygon() {
    }

    public Polygon(Point[] points) {
        this.points = new Point[points.length];

        points = this.removeMulti(points);  //去除重复点
        if (points.length <= 2) {
            this.status = -1;
            return;
        }

        //相邻边夹角0则去除中间点，夹角180则status:-1
        for (int i = 0; i < points.length; i++) {
            int first = i, second = (i + 1) % points.length, third = (i + 2) % points.length;
            Line l1 = new Line(points[first], points[second]);
            Line l2 = new Line(points[second], points[third]);
            if (Math.abs(l1.vectorAngle(l2) - Math.PI) < 0.000001) {    //夹角180
                this.status = -1;
                return;
            } else if (Math.abs(l1.vectorAngle(l2)) > 0.000001) {   //夹角不为0
                this.points[this.len++] = points[second].deepCopy();
            }
        }
        
        this.points = Arrays.copyOf(this.points, this.len);
        this.lines = new Line[this.len];
        
        for (int i = 0; i < this.len; i++) {
            this.lines[i] = new Line(this.points[i], this.points[(i + 1) % this.len]);
        }

//        //判断任意不相邻边(线段交点)是否有交点
        checkEdge();
        Polygon.area(this);
        Polygon.sideLength(this);
        Polygon.checkConvex(this);
    }

    //判断不相邻边是否有交点
    private void checkEdge() {
        for (int i = 0; i < this.len; i++) {
            for (int j = i + 2; j < this.len; j++) {
                if (i == 0 && j == this.len - 1) continue;
                Point p = this.lines[i].getIntersection(this.lines[j]);
                if (p == null) continue;

                if (this.lines[i].IsMid(p) && this.lines[j].IsMid(p)) {
                    this.status = -1;
                    return;
                }
            }
        }
    }

    public static void getArea(Polygon e) {
        double s = 0;
        for (int i = 0; i < e.len; i++) {
            s += e.points[i % e.len].x * e.points[(i + 1) % e.len].y - e.points[i % e.len].y * e.points[(i + 1) % e.len].x;
        }
        e.area = s;
    }

    public double getArea(Point[] points) {
        double s = 0;
        for (int i = 0; i < points.length; i++) {
            s += points[i % points.length].x * points[(i + 1) % points.length].y - points[i % points.length].y * points[(i + 1) % points.length].x;
        }
        return s * 0.5;
    }

    //多边形周长
    private static void sideLength(Polygon e) {
        double res = 0;
        for (int i = 0; i < e.len; i++) {
            res += e.points[i].distance(e.points[(i + 1) % e.len]);
        }
        e.sideLength = res;
    }

    //判断图形是否包含某个点返回值1,0,-1 (内部，边缘，外部)
    //由于只考虑凸多边形，用面积法就行
    public int IsInThePolygon(Point p) {
        for (int i = 0; i < this.len; i++) {
            if (Math.abs(lines[i].getDistance(p)) < 0.0000001 && lines[i].IsMid(p)) {
                return 0;
            }
        }
        double s = 0;
        for (int i = 0; i < this.len; i++) {
            s += Triangle.area(p, this.points[i], this.points[(i + 1) % this.len]);
        }
        return Math.abs(s - this.area) < 0.0000001 ? 1 : -1;
    }

    private static void area(Polygon e) {
        double res = 0;
        Point origin = new Point(0, 0);
        for (int i = 0; i < e.len; i++) {
            try {
                Line l1 = new Line(origin, e.points[i]);
                Line l2 = new Line(origin, e.points[(i + 1) % e.len]);
                res += 0.5 * l1.vectorCrossMul(l2);
            } catch (Exception reason) {
            }

        }
        e.area = Math.abs(res);
    }

    public void Show(double num) {
        System.out.println(new DecimalFormat("0.0#####").format(num));
    }

    public void Show_area(double area1, double area2) {
        if (area1 > area2) {
            System.out.println("2 " + new DecimalFormat("0.0##").format(area2) + " " + new DecimalFormat("0.0###").format(area1));
        } else {
            System.out.println("2 " + new DecimalFormat("0.0##").format(area1) + " " + new DecimalFormat("0.0###").format(area2));
        }
    }

    //计算两个图形的重叠面积(交点加内部顶点构成重叠多边形)
    public double overlappingArea(Polygon p) {
        Point[] intersection = new Point[100];
        int intersection_len = 0;

        for (Line item1 : this.lines) {   //求出两多边形的交点
            for (Line item2 : p.lines) {
                Point tmp = item1.LineSegmentIntersection(item2);
                if (tmp != null) {
                    intersection[intersection_len++] = tmp.deepCopy();
                }
            }
        }
        
        if (intersection_len == 0) {
            return 0;
        }

        for (Point item : p.points) {   //顶点包含在内部
            if (this.IsInThePolygon(item) == 1) intersection[intersection_len++] = item.deepCopy();
        }
        for (Point item : this.points) {   //顶点包含在内部
            if (p.IsInThePolygon(item) == 1) intersection[intersection_len++] = item.deepCopy();
        }

        /*排序交点数组*/
        intersection = Arrays.copyOf(intersection, intersection_len);
        intersection = this.removeMulti(intersection);
        Point focus = Point.focusPoint(intersection);
        Point sta = intersection[0].deepCopy();

        Arrays.sort(intersection, 1, intersection.length, new Comparator<Point>() {
            @Override
            public int compare(Point o1, Point o2) {
                Line origin = new Line(focus, sta);
                Line l1 = new Line(focus, o1);
                Line l2 = new Line(focus, o2);
                double angle1 = origin.vectorAngle(l1);
                double angle2 = origin.vectorAngle(l2);
                if (origin.vectorCrossMul(l1) < 0) angle1 = 2 * Math.PI - angle1;
                if (origin.vectorCrossMul(l2) < 0) angle2 = 2 * Math.PI - angle2;
                if (angle1 - angle2 > 0.000001) return 1;
                if (Math.abs(angle1 - angle2) < 0.000001) return 0;
                return -1;
            }
        });

        Polygon p1 = new Polygon(intersection);
        return p1.area;
    }

    //去除所有重复点
    private Point[] removeMulti(Point[] points) {
        Point[] tmp_points = new Point[points.length];
        int tmp_len = 0;

        for (int i = 0; i < points.length; i++) {
            boolean ok = true;
            for (int j = 0; j < tmp_len; j++) {
                if (points[i].equal(tmp_points[j])) {
                    ok = false;
                    break;
                }
            }
            if (ok) tmp_points[tmp_len++] = points[i].deepCopy();
        }
        return Arrays.copyOf(tmp_points, tmp_len);
    }

    public static void checkConvex(Polygon e) {
        if (e.len == 3) return;
        int v = 0;
        for (int i = 0; i < e.len; i++) {
            int first = i, second = (i + 1) % e.len, thrid = (i + 2) % e.len;
            try {
                Line l1 = new Line(e.points[first], e.points[second]);
                Line l2 = new Line(e.points[first], e.points[thrid]);
                if (v == 0) {
                    if (l1.vectorCrossMul(l2) > 0) v = 1;
                    else v = -1;
                }
                if (v == 1 && l1.vectorCrossMul(l2) < 0) e.isConvexGraphical = false;
                if (v == -1 && l1.vectorCrossMul(l2) > 0) e.isConvexGraphical = false;
            } catch (Exception reason) {
            }
        }
    }

    //判断两个图形类之间的关系()
    public String relationshipWith(Polygon p) {
        String[] name = new String[]{"triangle", "quadrilateral", "pentagon"};
        //分离
        if (this.isSeparatedFrom(p)) {
            return "no overlapping area between the previous " + name[this.len - 3] + " and the following " + name[p.len - 3];
        }
        //完全重合
        if (this.isSameTo(p))
            return "the previous " + name[this.len - 3] + " coincides with the following " + name[p.len - 3];
        //包含
        if (this.isContainPol(p)) {
            return "the previous " + name[this.len - 3] + " contains the following " + name[p.len - 3];
        }
        //被包含
        if (p.isContainPol(this)) {
            return "the previous " + name[this.len - 3] + " is inside the following " + name[p.len - 3];
        }

        //连接
        if (this.overlappingArea(p) == 0) {
            return "the previous " + name[this.len - 3] + " is connected to the following " + name[p.len - 3];
        }else{
            //交错
            return "the previous " + name[this.len - 3] + " is interlaced with the following " + name[p.len - 3];
        }
    }

    //判断两个图形是否一模一样(点完全重合)
    public boolean isSameTo(Polygon g) {
        if (this.len != g.len) return false;
        for (int i = 0; i < this.len; i++) {
            boolean ok = false;
            for (int j = 0; j < g.len; j++) {
                if (this.points[i].equal(g.points[j])) ok = true;
            }
            if (!ok) return false;
        }
        return true;
    }

    //判断完全包含另一个图形（任意点都在this之内）
    public boolean isContainPol(Polygon p) {
        boolean ok = true;
        int[] check2 = new int[p.len];
        for (int i = 0; i < p.len; i++) {
            check2[i] = this.IsInThePolygon(p.points[i]);
        }
        for (int item : check2) {
            if (item == -1) ok = false;
        }
        return ok;
    }

    //判断和另一个图形完全分离(重叠面积为0，并且任意点都在this之外)
    public boolean isSeparatedFrom(Polygon p) {
        boolean ok = true;
        int[] check2 = new int[p.len];
        for (int i = 0; i < p.len; i++) {
            check2[i] = this.IsInThePolygon(p.points[i]);
        }
        for (int item : check2) {
            if (item != -1) ok = false;
        }
        if (this.overlappingArea(p) != 0) ok = false;
        return ok;
    }
}

这次使用了继承关系，并且将大多数方法都放到了父类中使用，大大减少了子类的内容。

期中考试：

（7-1）点与线

• 设计一个类表示平面直角坐标系上的点Point，私有属性分别为横坐标x与纵坐标y，数据类型均为实型数，除构造方法以及属性的getter与setter方法外，定义一个用于显示信息的方法display(),用来输出该坐标点的坐标信息，格式如下：(x,y)，数值保留两位小数。为简化题目，其中，坐标点的取值范围设定为(0,200]。若输入有误，系统则直接输出Wrong Format

• 设计一个类表示平面直角坐标系上的线Line，私有属性除了标识线段两端的点point1、point2外，还有一个字符串类型的color，用于表示该线段的颜色，同样，除构造方法以及属性的getter与setter方法外，定义一个用于计算该线段长度的方法getDistance(),还有一个用于显示信息的方法display(),用来输出线段的相关信息，输出格式如下：

    ```
        The line's color is:颜色值
        The line's begin point's Coordinate is:
        (x1,y1)
        The line's end point's Coordinate is:
        (x2,y2)
        The line's length is:长度值
    ```
  

   

  其中，所有数值均保留两位小数，建议可用String.format("%.2f", data)方法。

    设计类图如下图所示。
  

   

** 题目要求：在主方法中定义一条线段对象，从键盘输入该线段的起点坐标与终点坐标以及颜色，然后调用该线段的display()方法进行输出。**

• 以下情况为无效作业
  • 无法运行
  • 设计不符合所给类图要求
  • 未通过任何测试点测试
  • 判定为抄袭

输入格式:

分别输入线段的起点横坐标、纵坐标、终点的横坐标、纵坐标以及颜色，中间可用一个或多个空格、tab或者回车分隔。

输出格式:

The line's color is:颜色值
The line's begin point's Coordinate is:
(x1,y1)
The line's end point's Coordinate is:
(x2,y2)
The line's length is:长度值

 

输入样例1:

在这里给出一组输入。例如：

5
9.4
12.3
84
Red

 

输出样例1:

在这里给出相应的输出。例如：

The line's color is:Red
The line's begin point's Coordinate is:
(5.00,9.40)
The line's end point's Coordinate is:
(12.30,84.00)
The line's length is:74.96

 

输入样例2:

在这里给出一组输入。例如：

80.2356
352.12
24.5
100
Black

 

输出样例2:

在这里给出相应的输出。例如：

Wrong Format


SourceMonito报表

 

类图：　

完整代码：

import java.util.Scanner;
import java.text.DecimalFormat;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        double x, y;
        x = sc.nextDouble();
        y = sc.nextDouble();
        if (x > 200 || x <= 0) {
            System.out.println("Wrong Format");
            System.exit(0);
        }
        if (y > 200 || y <= 0) {
            System.out.println("Wrong Format");
            System.exit(0);
        }
        Point Point1 = new Point(x, y);
        x = sc.nextDouble();
        y = sc.nextDouble();
        if (x > 200 || x <= 0) {
            System.out.println("Wrong Format");
            System.exit(0);
        }
        if (y > 200 || y <= 0) {
            System.out.println("Wrong Format");
            System.exit(0);
        }
        Point Point2 = new Point(x, y);
        String color = sc.next();
        Line line = new Line(Point1, Point2, color);
        line.display();
    }
}

class Point {
    private double x, y;

    public Point() {

    }

    public Point(double x, double y) {
        this.x = x;
        this.y = y;
    }

    public double getX() {
        return x;
    }

    public void setX(double x) {
        this.x = x;
    }

    public double getY() {
        return y;
    }

    public void setY(double y) {
        this.y = y;
    }

    public void display() {
        System.out.printf("(%.2f,%.2f)", x, y);
        System.out.println();
    }
}

class Line {
    Point Point1;
    Point Point2;
    String color;

    public Line() {

    }

    public Line(Point point1, Point point2, String color) {
        Point1 = point1;
        Point2 = point2;
        this.color = color;
    }

    public Point getPoint1() {
        return Point1;
    }

    public void setPoint1(Point point1) {
        Point1 = point1;
    }

    public Point getPoint2() {
        return Point2;
    }

    public void setPoint2(Point point2) {
        Point2 = point2;
    }

    public String getColor() {
        return color;
    }

    public void setColor(String color) {
        this.color = color;
    }

    public void display() {
        System.out.println("The line's color is:" + color);
        System.out.println("The line's begin point's Coordinate is:");
        this.Point1.display();
        System.out.println("The line's end point's Coordinate is:");
        this.Point2.display();
        double length = Math.sqrt(Math.pow(this.Point1.getX() - this.Point2.getX(), 2) + Math.pow(this.Point1.getY() - this.Point2.getY(), 2));
        System.out.println("The line's length is:"+new DecimalFormat("0.0#").format(length));
    }
}

这次较为简单，只使用了点线类。

（7-2）点线面问题重构

在“点与线（类设计）”题目基础上，对题目的类设计进行重构，以实现继承与多态的技术性需求。

• 对题目中的点Point类和线Line类进行进一步抽象，定义一个两个类的共同父类Element（抽象类），将display()方法在该方法中进行声明（抽象方法），将Point类和Line类作为该类的子类。
• 再定义一个Element类的子类面Plane，该类只有一个私有属性颜色color，除了构造方法和属性的getter、setter方法外，display()方法用于输出面的颜色，输出格式如下：The Plane's color is:颜色
• 在主方法内，定义两个Point（线段的起点和终点）对象、一个Line对象和一个Plane对象，依次从键盘输入两个Point对象的起点、终点坐标和颜色值（Line对象和Plane对象颜色相同），然后定义一个Element类的引用，分别使用该引用调用以上四个对象的display()方法，从而实现多态特性。示例代码如下：

        element = p1;//起点Point
        element.display();
        
        element = p2;//终点Point
        element.display();
        
        element = line;//线段
        element.display();
        
        element = plane;//面
        element.display();
  

   
  类结构如下图所示。

其中，所有数值均保留两位小数，建议可用String.format("%.2f", data)方法。

• 以下情况为无效作业
  • 无法运行
  • 设计不符合所给类图要求
  • 未通过任何测试点测试
  • 判定为抄袭

输入格式:

分别输入线段的起点横坐标、纵坐标、终点的横坐标、纵坐标以及颜色，中间可用一个或多个空格、tab或者回车分隔。

输出格式:

(x1,y1)
(x2,y2)
The line's color is:颜色值
The line's begin point's Coordinate is:
(x1,y1)
The line's end point's Coordinate is:
(x2,y2)
The line's length is:长度值
The Plane's color is:颜色值

 

输入样例1:

在这里给出一组输入。例如：

5
9.4
12.3
84
Red

 

输出样例1:

在这里给出相应的输出。例如：

(5.00,9.40)
(12.30,84.00)
The line's color is:Red
The line's begin point's Coordinate is:
(5.00,9.40)
The line's end point's Coordinate is:
(12.30,84.00)
The line's length is:74.96
The Plane's color is:Red

 

输入样例2:

在这里给出一组输入。例如：

5
9.4
12.3
845
Black

 

输出样例2:

在这里给出相应的输出。例如：

Wrong Format

SourceMonito报表

 

类图:

完整代码：

import java.util.Scanner;


public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        double x, y;
        x = sc.nextDouble();
        y = sc.nextDouble();
        if (x > 200 || x <= 0) {
            System.out.println("Wrong Format");
            System.exit(0);
        }
        if (y > 200 || y <= 0) {
            System.out.println("Wrong Format");
            System.exit(0);
        }
        Point P1 = new Point(x, y);
        x = sc.nextDouble();
        y = sc.nextDouble();
        if (x > 200 || x <= 0) {
            System.out.println("Wrong Format");
            System.exit(0);
        }
        if (y > 200 || y <= 0) {
            System.out.println("Wrong Format");
            System.exit(0);
        }
        Point P2 = new Point(x, y);
        String color = sc.next();
        Line line = new Line(P1, P2, color);
        Plane plane = new Plane(color);
        Element element;
        element = P1;
        element.display();
        element = P2;
        element.display();
        element = line;
        element.display();
        element = plane;
        element.display();
    }
}

class Point extends Element {
    private double x, y;

    public Point() {

    }

    public Point(double x, double y) {
        this.x = x;
        this.y = y;
    }

    public double getX() {
        return x;
    }

    public void setX(double x) {
        this.x = x;
    }

    public double getY() {
        return y;
    }

    public void setY(double y) {
        this.y = y;
    }

    public void display() {
       System.out.println("(" + String.format("%.2f", x) + "," + String.format("%.2f", y) + ")");
    }
}

class Line extends Element {
    Point Point1;
    Point Point2;
    String color;

    public Line() {

    }

    public Line(Point point1, Point point2, String color) {
        Point1 = point1;
        Point2 = point2;
        this.color = color;
    }

    public Point getPoint1() {
        return Point1;
    }

    public void setPoint1(Point point1) {
        Point1 = point1;
    }

    public Point getPoint2() {
        return Point2;
    }

    public void setPoint2(Point point2) {
        Point2 = point2;
    }

    public String getColor() {
        return color;
    }

    public void setColor(String color) {
        this.color = color;
    }

    public void display() {
        System.out.println("The line's color is:" + color);
        System.out.println("The line's begin point's Coordinate is:");
        this.Point1.display();
        System.out.println("The line's end point's Coordinate is:");
        this.Point2.display();
        double length = Math.sqrt(Math.pow(this.Point1.getX() - this.Point2.getX(), 2) + Math.pow(this.Point1.getY() - this.Point2.getY(), 2));
        System.out.println("The line's length is:" + String.format("%.2f", length));
    }
}

class Plane extends Element {
    private String color;

    public Plane() {

    }

    public Plane(String color) {
        this.color = color;
    }

    public String getColor() {
        return color;
    }

    public void setColor(String color) {
        this.color = color;
    }

    public void display() {
        System.out.println("The Plane's color is:" + color);
    }
}

abstract class Element {
    public abstract void display();
}

题目要求使用抽象类，继承关系。

在题目输出方式上试了较多次。

（7-3）点线面问题再重构（容器类）

在“点与线（继承与多态）”题目基础上，对题目的类设计进行重构，增加容器类保存点、线、面对象，并对该容器进行相应增、删、遍历操作。

• 在原有类设计的基础上，增加一个GeometryObject容器类，其属性为ArrayList<Element>类型的对象（若不了解泛型，可以不使用<Element>）
• 增加该类的add()方法及remove(int index)方法，其功能分别为向容器中增加对象及删除第index - 1（ArrayList中index>=0）个对象
• 在主方法中，用户循环输入要进行的操作（choice∈[0,4]），其含义如下：
  • 1：向容器中增加Point对象
  • 2：向容器中增加Line对象
  • 3：向容器中增加Plane对象
  • 4：删除容器中第index - 1个数据，若index数据非法，则无视此操作
  • 0：输入结束
  示例代码如下：

     choice = input.nextInt();
      while(choice != 0) {
          switch(choice) {
          case 1://insert Point object into list 
            ...
              break;
          case 2://insert Line object into list
              ...
              break;
          case 3://insert Plane object into list
              ...
              break;
          case 4://delete index - 1 object from list
              int index = input.nextInt();
              ...
          }
          choice = input.nextInt();
      }
  

   
  输入结束后，按容器中的对象顺序分别调用每个对象的display()方法进行输出。
  类图如下所示：

• 以下情况为无效作业
  • 无法运行
  • 设计不符合所给类图要求
  • 未通过任何测试点测试
  • 判定为抄袭

输入格式:

switch(choice) {
            case 1://insert Point object into list 
              输入“点”对象的x，y值
                break;
            case 2://insert Line object into list
                输入“线”对象两个端点的x，y值
                break;
            case 3://insert Plane object into list
                输入“面”对象的颜色值
                break;
            case 4://delete index - 1 object from list
                输入要删除的对象位置（从1开始）
                ...
            }

 

输出格式:

• Point、Line、Plane的输出参考题目2
• 删除对象时，若输入的index超出合法范围，程序自动忽略该操作

输入样例:

在这里给出一组输入。例如：

1
3.4
5.6
2
4.4
8.0
0.98
23.888
Red
3
Black
1
9.8
7.5
3
Green
4
3
0

 

输出样例:

在这里给出相应的输出。例如：

(3.40,5.60)
The line's color is:Red
The line's begin point's Coordinate is:
(4.40,8.00)
The line's end point's Coordinate is:
(0.98,23.89)
The line's length is:16.25
(9.80,7.50)
The Plane's color is:Green


SourceMonito报表

类图：

完整代码：

import java.util.ArrayList;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        GeometryObject go = new GeometryObject();
        int choice = input.nextInt();
        while (choice != 0) {
            switch (choice) {
                case 1:
                    Point p = new Point(input.nextDouble(), input.nextDouble());
                    go.add(p);
                    break;
                case 2:
                    Point p1 = new Point(input.nextDouble(), input.nextDouble());
                    Point p2 = new Point(input.nextDouble(), input.nextDouble());
                    String str1 = input.next();
                    Line line = new Line(p1, p2, str1);
                    go.add(line);
                    break;
                case 3:
                    String str2 = input.next();
                    Plane plane = new Plane(str2);
                    go.add(plane);
                    break;
                case 4:
                    int index = input.nextInt();
                    go.remove(index);
                    break;
            }
            choice = input.nextInt();
        }
        ArrayList<Element> arr = go.getArr();
        for (int i = 0; i < arr.size(); i++) {
            arr.get(i).display();
        }
    }
}

class GeometryObject {
    private ArrayList<Element> arr = new ArrayList<>();

    public GeometryObject() {

    }

    public void add(Element element) {
        arr.add(element);
    }

    public ArrayList<Element> getArr() {
        return arr;
    }

    public void remove(int index) {
        if (index > 0 && index <= arr.size()){
            arr.remove(index - 1);
        }
    }
}

class Point extends Element {
    private double x, y;

    public Point() {

    }

    public Point(double x, double y) {
        this.x = x;
        this.y = y;
    }

    public double getX() {
        return x;
    }

    public void setX(double x) {
        this.x = x;
    }

    public double getY() {
        return y;
    }

    public void setY(double y) {
        this.y = y;
    }

    public void display() {
        //System.out.println("(" + new DecimalFormat("0.0#").format(x) + "," + new DecimalFormat("0.0#").format(y) + ")");
//        System.out.printf("(%.2f,%.2f)", x, y);
//        System.out.println();
        System.out.println("(" + String.format("%.2f", x) + "," + String.format("%.2f", y) + ")");
    }

}

class Line extends Element {
    Point Point1;
    Point Point2;
    String color;

    public Line() {

    }

    public Line(Point point1, Point point2, String color) {
        Point1 = point1;
        Point2 = point2;
        this.color = color;
    }

    public Point getPoint1() {
        return Point1;
    }

    public void setPoint1(Point point1) {
        Point1 = point1;
    }

    public Point getPoint2() {
        return Point2;
    }

    public void setPoint2(Point point2) {
        Point2 = point2;
    }

    public String getColor() {
        return color;
    }

    public void setColor(String color) {
        this.color = color;
    }

    public void display() {
        System.out.println("The line's color is:" + color);
        System.out.println("The line's begin point's Coordinate is:");
        this.Point1.display();
        System.out.println("The line's end point's Coordinate is:");
        this.Point2.display();
        double length = Math.sqrt(Math.pow(this.Point1.getX() - this.Point2.getX(), 2) + Math.pow(this.Point1.getY() - this.Point2.getY(), 2));
        System.out.println("The line's length is:" + String.format("%.2f", length));
    }
}

class Plane extends Element {
    private String color;

    public Plane() {

    }

    public Plane(String color) {
        this.color = color;
    }

    public String getColor() {
        return color;
    }

    public void setColor(String color) {
        this.color = color;
    }

    public void display() {
        System.out.println("The Plane's color is:" + color);
    }
}

abstract class Element {
    public abstract void display();
}

在删除数据上，要删除第index-1个，之前的方法会删除第-1个，超出了范围。

踩坑心得：

题目集4（7-2）

这道题要注意凹凸四边形的判断和点在四边形内的判断方法。

题目集5（7-2）

这道题要注意凹凸四边形的判断和面积的计算以及五边形无法形成时的处理方法

期中考试（7-3）

在删除数据上，要删除第index-1个，之前的方法会删除第-1个，超出了范围。要注意index的数据范围。

总结：

　　通过这几次大作业和考试，我对面向对象有了更深层次的了解，同时对如何设计框架，如何使用继承，多态了解了更多。