Write a program to recognize line patterns in a given set of points. Computer vision involves analyzing patterns in visual images and reconstructing the real-world objects that produced them. The process is often broken up into two phases: feature detection and pattern recognition. Feature detection involves selecting important features of the image; pattern recognition involves discovering patterns in the features. We will investigate a particularly clean pattern recognition problem involving points and line segments. This kind of pattern recognition arises in many other applications such as statistical data analysis. The problem. Given a set of n distinct points in the plane, find every (maximal) line segment that connects a subset of 4 or more of the points. (0, 0) (0, 0) Point data type. Create an immutable data type Point that represents a point in the plane by implementing the following API: public class Point implements Comparable { public Point(int x, int y) // constructs the point (x, y) public void draw) public void drawTo (Point that) public String toString() // draws this point // draws the line segment from this point to that point // string representation public int compareTo(Point that) public double slopeTo(Point that) public Comparator slopeOrder() // compare two points by y-coordinates, breaking ties by x-coordinates // the slope between this point and that point // compare two points by slopes they make with this point ollinear.zip public double slopelo(Point that) public Comparator slopeOrder() // the slope between this point and that point // compare two points by slopes they make with this point } To get started, use the data type Point.java , which implements the constructor and the draw(), drawto(), and toString() methods. Your job is to add the following components. The compareTo() method should compare points by their y-coordinates, breaking ties by their x-coordinates. Formally, the invoking point (x0, Yo) is less than the argument point (x1, y1) if and only if either yoyu or if yo = y; and xo (0, 10000) (3000, 4000) -> (20000, 21000) % java-algs4 FastCollinearPoints inputs.txt (3000, 4000) -> (20000, 21000) (0, 10000) -> (10000, 0) % java-algs4 FastCollinearPoints input6.txt (14000, 10000) -> (32000, 10000) collinear.zip Show all Write a program to recognize line patterns in a given set of points. Computer vision involves analyzing patterns in visual images and reconstructing the real-world objects that produced them. The process is often broken up into two phases: feature detection and pattern recognition. Feature detection involves selecting important features of the image; pattern recognition involves discovering patterns in the features. We will investigate a particularly clean pattern recognition problem involving points and line segments. This kind of pattern recognition arises in many other applications such as statistical data analysis. The problem. Given a set of n distinct points in the plane, find every (maximal) line segment that connects a subset of 4 or more of the points. (0, 0) (0, 0) Point data type. Create an immutable data type Point that represents a point in the plane by implementing the following API: public class Point implements Comparable { public Point(int x, int y) // constructs the point (x, y) public void draw) public void drawTo (Point that) public String toString() // draws this point // draws the line segment from this point to that point // string representation public int compareTo(Point that) public double slopeTo(Point that) public Comparator slopeOrder() // compare two points by y-coordinates, breaking ties by x-coordinates // the slope between this point and that point // compare two points by slopes they make with this point ollinear.zip public double slopelo(Point that) public Comparator slopeOrder() // the slope between this point and that point // compare two points by slopes they make with this point } To get started, use the data type Point.java , which implements the constructor and the draw(), drawto(), and toString() methods. Your job is to add the following components. The compareTo() method should compare points by their y-coordinates, breaking ties by their x-coordinates. Formally, the invoking point (x0, Yo) is less than the argument point (x1, y1) if and only if either yoyu or if yo = y; and xo (0, 10000) (3000, 4000) -> (20000, 21000) % java-algs4 FastCollinearPoints inputs.txt (3000, 4000) -> (20000, 21000) (0, 10000) -> (10000, 0) % java-algs4 FastCollinearPoints input6.txt (14000, 10000) -> (32000, 10000) collinear.zip Show all