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:
Overview of Spring Boot Dev Tools
Java Convenience Factory Methods for Collections
Java Program to Implement Ford–Fulkerson Algorithm
JUnit 5 @Test Annotation
Spring Boot - Zuul Proxy Server and Routing
Circular Dependencies in Spring
Period and Duration in Java
Vấn đề Nhà sản xuất (Producer) – Người tiêu dùng (Consumer) và đồng bộ hóa các luồng trong Java
Spring Security – Reset Your Password
Quick Intro to Spring Cloud Configuration
Java String to InputStream
Java Program to Implement Best-First Search
Introduction to Spring Security Expressions
The Dining Philosophers Problem in Java
Java Program to Solve a Matching Problem for a Given Specific Case
Java Program to Implement Treap
Spring RestTemplate Request/Response Logging
Converting Java Date to OffsetDateTime
Java Program to Implement HashTable API
Java Program to Implement Unrolled Linked List
Java Program to Find MST (Minimum Spanning Tree) using Prim’s Algorithm
@Order in Spring
Changing Annotation Parameters At Runtime
Spring Cloud – Securing Services
String Initialization in Java
Spring Boot - Introduction
Java Program to Delete a Particular Node in a Tree Without Using Recursion
Spring Security Form Login
New Features in Java 10
Java Program to Find the Nearest Neighbor Using K-D Tree Search
Java Program to Implement Floyd Cycle Algorithm
Java Program to Check whether Graph is a Bipartite using 2 Color Algorithm