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:

Java Program to Implement Circular Doubly Linked List
CyclicBarrier in Java
Spring Cloud – Tracing Services with Zipkin
Debug a HttpURLConnection problem
Spring Boot - CORS Support
Java – Reader to String
Spring RestTemplate Request/Response Logging
Adding a Newline Character to a String in Java
Guide to Java Instrumentation
Java 8 Collectors toMap
Tiêu chuẩn coding trong Java (Coding Standards)
Dockerizing a Spring Boot Application
REST Web service: Tạo ứng dụng Java RESTful Client với Jersey Client 2.x
The Order of Tests in JUnit
Vòng lặp for, while, do-while trong Java
Java Program to Create the Prufer Code for a Tree
Lập trình đa luồng với CompletableFuture trong Java 8
Java Deep Learning Essentials - Yusuke Sugomori
Java Program to Check if a Given Binary Tree is an AVL Tree or Not
Java Program to Implement Aho-Corasick Algorithm for String Matching
Spring Data MongoDB – Indexes, Annotations and Converters
Java Program to Check whether Graph is a Bipartite using BFS
Netflix Archaius with Various Database Configurations
New Features in Java 14
Java Program to Generate a Sequence of N Characters for a Given Specific Case
Removing all Nulls from a List in Java
Từ khóa throw và throws trong Java
Command-Line Arguments in Java
Java Program to Construct an Expression Tree for an Postfix Expression
Java Program to Perform the Sorting Using Counting Sort
Java Program to Find the Longest Subsequence Common to All Sequences in a Set of Sequences
Java Program to Perform Addition Operation Using Bitwise Operators