This is a Java Program to Implement Shoelace Algorithm. The shoelace formula, or shoelace algorithm, is a mathematical algorithm to determine the area of a simple polygon whose vertices are described by ordered pairs in the plane
Here is the source code of the Java Program to Implement Shoelace Algorithm. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
/**
** Java Program to Implement Shoelace Algorithm
**/
import java.util.Scanner;
/** Class Shoelace **/
public class Shoelace
{
/** Function to calculate area **/
public double area(int[][] arr)
{
int n = arr.length;
/** copy initial point to last row **/
arr[n - 1][0] = arr[0][0];
arr[n - 1][1] = arr[0][1];
double det = 0.0;
/** add product of x coordinate of ith point with y coordinate of (i + 1)th point **/
for (int i = 0; i < n - 1; i++)
det += (double)(arr[i][0] * arr[i + 1][1]);
/** subtract product of y coordinate of ith point with x coordinate of (i + 1)th point **/
for (int i = 0; i < n - 1; i++)
det -= (double)(arr[i][1] * arr[i + 1][0]);
/** find absolute value and divide by 2 **/
det = Math.abs(det);
det /= 2;
return det;
}
/** Main function **/
public static void main (String[] args)
{
Scanner scan = new Scanner(System.in);
System.out.println("Shoelace Algorithm Test\n");
/** Make an object of Shoelace class **/
Shoelace s = new Shoelace();
/** Accept number of points **/
System.out.println("\nEnter number of points");
int n = scan.nextInt();
int[][] arr = new int[n + 1][2];
System.out.println("Enter "+ n +" x, y coordinates");
for (int i = 0; i < n; i++)
{
arr[i][0] = scan.nextInt();
arr[i][1] = scan.nextInt();
}
double area = s.area(arr);
System.out.println("\nArea = "+ area);
}
}
Output:
Shoelace Algorithm Test Enter number of points 5 Enter 5 x, y coordinates 3 4 5 11 12 8 9 5 5 6 Area = 30.0
Related posts:
Java Program to implement Bit Matrix
Check If a File or Directory Exists in Java
HttpClient Basic Authentication
Spring Security Logout
Thao tác với tập tin và thư mục trong Java
Java Program to Compute the Volume of a Tetrahedron Using Determinants
Java Program to Perform Insertion in a 2 Dimension K-D Tree
Hướng dẫn Java Design Pattern – MVC
Java Program to Compute DFT Coefficients Directly
Mệnh đề Switch-case trong java
Java Program to Implement Stein GCD Algorithm
OAuth2 for a Spring REST API – Handle the Refresh Token in Angular
Java Program to Implement Suffix Tree
Java Program to Implement Hash Tree
Java Program to Describe the Representation of Graph using Adjacency List
Java Program to Find the Longest Path in a DAG
Ignore Null Fields with Jackson
Getting Started with Forms in Spring MVC
Java Program to Find Path Between Two Nodes in a Graph
Tạo số và chuỗi ngẫu nhiên trong Java
Practical Java Examples of the Big O Notation
Reactive Flow with MongoDB, Kotlin, and Spring WebFlux
Spring Security Form Login
New Features in Java 15
Java Program to Implement Karatsuba Multiplication Algorithm
Java Program to Implement Range Tree
Tính đa hình (Polymorphism) trong Java
Java Program to Check if it is a Sparse Matrix
Mockito and JUnit 5 – Using ExtendWith
A Custom Data Binder in Spring MVC
Java Program to Check whether Undirected Graph is Connected using BFS
Java InputStream to Byte Array and ByteBuffer