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:

Loại bỏ các phần tử trùng trong một ArrayList như thế nào trong Java 8?
Xử lý ngoại lệ trong Java (Exception Handling)
How to Read HTTP Headers in Spring REST Controllers
Java Perform to a 2D FFT Inplace Given a Complex 2D Array
Different Ways to Capture Java Heap Dumps
Java Program to Find the Shortest Path from Source Vertex to All Other Vertices in Linear Time
Hướng dẫn Java Design Pattern – Chain of Responsibility
Java Program to Implement LinkedBlockingDeque API
How to Delay Code Execution in Java
Java – Reader to String
Guide to the Java TransferQueue
Java Program to Implement Quick sort
Tính đóng gói (Encapsulation) trong java
Java Program to Find Whether a Path Exists Between 2 Given Nodes
Lập trình đa luồng với CompletableFuture trong Java 8
Remove All Occurrences of a Specific Value from a List
Using JWT with Spring Security OAuth (legacy stack)
Hướng dẫn Java Design Pattern – DAO
LinkedHashSet trong Java hoạt động như thế nào?
So sánh Array và ArrayList trong Java
Working with Tree Model Nodes in Jackson
Java Program to Implement Traveling Salesman Problem using Nearest neighbour Algorithm
So sánh HashSet, LinkedHashSet và TreeSet trong Java
Spring RestTemplate Error Handling
Spring’s RequestBody and ResponseBody Annotations
Anonymous Classes in Java
Java program to Implement Tree Set
Mảng (Array) trong Java
Java Program to Check whether Graph is Biconnected
Java – Try with Resources
Java Program to Use the Bellman-Ford Algorithm to Find the Shortest Path
Java Program to Find a Good Feedback Edge Set in a Graph