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 Check whether Directed Graph is Connected using BFS
Spring Web Annotations
Java Program to Find the Nearest Neighbor Using K-D Tree Search
Array to String Conversions
Documenting a Spring REST API Using OpenAPI 3.0
Java Switch Statement
Java Program to Perform Search in a BST
Spring Security Registration – Resend Verification Email
Java Program to Implement Singly Linked List
Java Program to Perform Postorder Recursive Traversal of a Given Binary Tree
Java Program to Find the Longest Path in a DAG
Java Program to Find Hamiltonian Cycle in an UnWeighted Graph
Different Ways to Capture Java Heap Dumps
Adding a Newline Character to a String in Java
Serialization và Deserialization trong java
How to Get All Dates Between Two Dates?
Tránh lỗi ConcurrentModificationException trong Java như thế nào?
Java Program to Implement Sorted List
Java Program to Check if a Given Graph Contain Hamiltonian Cycle or Not
Java Program to Implement Fermat Factorization Algorithm
Immutable ArrayList in Java
Java Program to Implement Coppersmith Freivald’s Algorithm
Chuyển đổi giữa các kiểu dữ liệu trong Java
Getting a File’s Mime Type in Java
Spring REST API + OAuth2 + Angular (using the Spring Security OAuth legacy stack)
Implementing a Binary Tree in Java
Creating a Custom Starter with Spring Boot
Java Program to Implement Segment Tree
Java Program to Implement Double Order Traversal of a Binary Tree
Introduction to Spring Method Security
So sánh ArrayList và LinkedList trong Java
Ignore Null Fields with Jackson