Java Program to Check if a Given Set of Three Points Lie on a Single Line or Not

This is a Java Program to check whether three points are collinear or not. We do this by taking two points make an equation of the line passing through those two points and check whether third points lies on it. In geometry, collinearity is a property of a set of points, specifically, the property of lying on a single line.

Here is the source code of the Java Program to Check if a Given Set of Three Points Lie on a Single Line or Not. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.

//This is a java program to check whether three points are collinear or not
import java.util.Scanner;
 
public class Collinear_Points
{
    public static void main(String args[])
    {
        System.out.println("Enter the points : <x>,<y>");
        Scanner scan = new Scanner(System.in);
        int x, y, x1, x2, y1, y2;
        x = scan.nextInt();
        y = scan.nextInt();
        x1 = scan.nextInt();
        x2 = scan.nextInt();
        y1 = scan.nextInt();
        y2 = scan.nextInt();
 
        /*
         * System.out.println("The Equation of the line is : (" + (y2 - y1) +
         * ")x+(" + (x1 - x2) + ")y+(" + (x2 * y1 - x1 * y2) + ") = 0");
         */
 
        int s = (y2 - y1) * x + (x1 - x2) * y + (x2 * y1 - x1 * y2);
        if (s < 0)
            System.out.println("The points are NOT collinear");
        else if (s > 0)
            System.out.println("The points are NOT collinear");
        else
            System.out.println("The points are collinear");
        scan.close();
    }
}

Output:

$ javac Collinear_Points.java
$ java Collinear_Points
 
Enter the points : <x>,<y>
3 2
1 3
1 5
The points are NOT collinear
 
Enter the points : <x>,<y>
1 1
1 5
1 9
The points are collinear

Related posts:

Java Program to Find Minimum Element in an Array using Linear Search
Java Program to Optimize Wire Length in Electrical Circuit
Java Program to Perform Searching in a 2-Dimension K-D Tree
Hướng dẫn Java Design Pattern – Visitor
Hướng dẫn Java Design Pattern – Decorator
Java Program to Implement Trie
Java Program to Implement the Edmond’s Algorithm for Maximum Cardinality Matching
Optional trong Java 8
Rest Web service: Filter và Interceptor với Jersey 2.x (P1)
Marker Interface trong Java
“Stream has already been operated upon or closed” Exception in Java
Java – Get Random Item/Element From a List
List Interface trong Java
Semaphore trong Java
Các chương trình minh họa sử dụng Cấu trúc điều khiển trong Java
Java Program to Implement Sorted Circularly Singly Linked List
Extra Login Fields with Spring Security
A Guide to Iterator in Java
Using Custom Banners in Spring Boot
Java Program to Implement RoleList API
A Guide to Concurrent Queues in Java
Java Program to Implement Wagner and Fisher Algorithm for online String Matching
Java Program to Perform the Unique Factorization of a Given Number
Java Program to Perform Naive String Matching
Array to String Conversions
Java Program to Give an Implementation of the Traditional Chinese Postman Problem
Functional Interfaces in Java 8
Java Program to Implement Bubble Sort
Lấy ngày giờ hiện tại trong Java
Spring @RequestParam Annotation
An Introduction to ThreadLocal in Java
Java Program to Implement Gauss Seidel Method