Java Program to Implement Slicker Algorithm that avoids Triangulation to Find Area of a Polygon

This is a Java Program to find the area of a polygon using slicker method. The algorithm assumes the usual mathematical convention that positive y points upwards. In computer systems where positive y is downwards (most of them) the easiest thing to do is list the vertices counter-clockwise using the “positive y down” coordinates. The two effects then cancel out to produce a positive area.

Here is the source code of the Java Program to Implement Slicker Algorithm that avoids Triangulation to Find Area of a Polygon. 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 find the area of polygon using Slicker algorithm
import java.util.*;
 
class Area_polygon_Slicker
{
    static final int MAXPOLY = 200;
    static final double EPSILON = 0.000001;
 
    static class Point
    {
        double x, y;
    }
 
    static class Polygon
    {
        Point p[] = new Point[MAXPOLY];
        int n;
 
        Polygon()
        {
            for (int i = 0; i < MAXPOLY; i++)
                p[i] = new Point();
        }
    }
 
    static double area(Polygon p)
    {
        double total = 0;
        for (int i = 0; i < p.n; i++)
        {
            int j = (i + 1) % p.n;
            total += (p.p[i].x * p.p[j].y) - (p.p[j].x * p.p[i].y);
        }
        return total / 2;
    }
 
    static public void main(String[] args)
    {
        Polygon p = new Polygon();
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter the number of points in Polygon: ");
        p.n = sc.nextInt();
        System.out.println("Enter the coordinates of each point: <x> <y>");
        for (int i = 0; i < p.n; i++)
        {
            p.p[i].x = sc.nextDouble();
            p.p[i].y = sc.nextDouble();
        }
 
        double area = area(p);
        if (area > 0)
            System.out.print("The Area of Polygon with " + p.n
                    + " points using Slicker Algorithm is : " + area);
        else
            System.out.print("The Area of Polygon with " + p.n
                    + " points using Slicker Algorithm is : " + (area * -1));
        sc.close();
    }
}

Output:

$ javac Area_polygon_Slicker.java
$ java Area_polygon_Slicker
 
Enter the number of points in Polygon: 
4
Enter the coordinates of each point: <x> <y>
1 1
1 6
6 6
6 1
The Area of Polygon with 4 points using Slicker Algorithm is : 25.0
 
Enter the number of points in Polygon: 
5
Enter the coordinates of each point: <x> <y>
1 2
4 5
9 8
3 2
1 5
The Area of Polygon with 5points using Slicker Algorithm is : 6.0

Related posts:

OAuth2.0 and Dynamic Client Registration
Custom Thread Pools In Java 8 Parallel Streams
Compact Strings in Java 9
Spring Boot: Customize Whitelabel Error Page
Lớp Arrarys trong Java (Arrays Utility Class)
Java Program to Implement LinkedTransferQueue API
The DAO with Spring and Hibernate
Xử lý ngoại lệ đối với trường hợp ghi đè phương thức trong java
Recommended Package Structure of a Spring Boot Project
Spring Boot - Hystrix
Java String to InputStream
Copy a List to Another List in Java
Spring Security Authentication Provider
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
Java Program to Implement Traveling Salesman Problem using Nearest neighbour Algorithm
Hướng dẫn Java Design Pattern – Singleton
Java Program to Implement Segment Tree
Java Program to Describe the Representation of Graph using Incidence List
Spring REST API with Protocol Buffers
Java – Write a Reader to File
Spring WebClient vs. RestTemplate
Adding Shutdown Hooks for JVM Applications
Java Program to Implement Iterative Deepening
Hướng dẫn Java Design Pattern – Chain of Responsibility
Java Program to Implement the String Search Algorithm for Short Text Sizes
What is a POJO Class?
Java Program to Implement Efficient O(log n) Fibonacci generator
SOAP Web service: Authentication trong JAX-WS
Java Program to Implement wheel Sieve to Generate Prime Numbers Between Given Range
Spring Boot - Google OAuth2 Sign-In
Java Program to Compute Discrete Fourier Transform Using the Fast Fourier Transform Approach
Java Program to Implement Unrolled Linked List