Java Program to Implement Shoelace Algorithm

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 the Checksum Method for Small String Messages and Detect
A Guide to Spring Cloud Netflix – Hystrix
Java Concurrency Interview Questions and Answers
A Guide to Java HashMap
Stack Memory and Heap Space in Java
Introduction to Using Thymeleaf in Spring
A Custom Media Type for a Spring REST API
Send email with SMTPS (eg. Google GMail)
Java Program to Implement Sieve Of Atkin
Lớp Properties trong java
Hướng dẫn Java Design Pattern – Factory Method
ETL with Spring Cloud Data Flow
Java Program to Implement Maximum Length Chain of Pairs
Java Program to Perform Preorder Recursive Traversal of a Given Binary Tree
Java – Reader to String
Abstract class và Interface trong Java
Registration with Spring Security – Password Encoding
Redirect to Different Pages after Login with Spring Security
Serve Static Resources with Spring
Java Program to Implement the linear congruential generator for Pseudo Random Number Generation
Java Stream Filter with Lambda Expression
Spring Boot - Code Structure
Hướng dẫn sử dụng lớp Console trong java
Hướng dẫn Java Design Pattern – Observer
Java Program to Implement Efficient O(log n) Fibonacci generator
Spring Cloud Connectors and Heroku
Java Program to Solve any Linear Equations
Java Program to Check whether Directed Graph is Connected using BFS
Java Program to Implement Segment Tree
Introduction to Spring Cloud Rest Client with Netflix Ribbon
Java Program to Check Whether Topological Sorting can be Performed in a Graph
Java Program to Implement Jarvis Algorithm