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:
An Intro to Spring Cloud Vault
Java Program to Implement Sparse Matrix
Introduction to Spring Cloud Netflix – Eureka
Java Program to Implement Traveling Salesman Problem using Nearest neighbour Algorithm
Java Program to Perform the Unique Factorization of a Given Number
Shuffling Collections In Java
“Stream has already been operated upon or closed” Exception in Java
Recommended Package Structure of a Spring Boot Project
Guide to the Volatile Keyword in Java
Java Program to Implement Uniform-Cost Search
Java Program to Check whether Undirected Graph is Connected using BFS
A Guide to Spring Cloud Netflix – Hystrix
Guide to Spring Cloud Kubernetes
How to Implement Caching using Adonis.js 5
Quick Guide to @RestClientTest in Spring Boot
Convert a Map to an Array, List or Set in Java
Java Program to Perform Stooge Sort
Thao tác với tập tin và thư mục trong Java
Tạo chương trình Java đầu tiên sử dụng Eclipse
Java Program to Implement Min Heap
Java Program to Check whether Graph is a Bipartite using DFS
Java Program to Perform Insertion in a 2 Dimension K-D Tree
Spring’s RequestBody and ResponseBody Annotations
Spring Data MongoDB – Indexes, Annotations and Converters
Java – Try with Resources
Java Program to Implement ArrayDeque API
Java Program to Create a Random Graph Using Random Edge Generation
Convert Hex to ASCII in Java
Collect a Java Stream to an Immutable Collection
Hướng dẫn Java Design Pattern – Decorator
Tìm hiểu cơ chế Lazy Evaluation của Stream trong Java 8
Java Program to Describe the Representation of Graph using Incidence List