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 for a Spring REST API – Handle the Refresh Token in AngularJS
Java Program to Check Whether a Given Point is in a Given Polygon
Assert an Exception is Thrown in JUnit 4 and 5
Java Program to Find Whether a Path Exists Between 2 Given Nodes
Guide to Selenium with JUnit / TestNG
Java Program to Implement the Program Used in grep/egrep/fgrep
Apache Commons Collections MapUtils
Sử dụng CyclicBarrier trong Java
Mệnh đề if-else trong java
Java Program to Implement Sorting of Less than 100 Numbers in O(n) Complexity
Java Program to Implement Graham Scan Algorithm to Find the Convex Hull
Using a Spring Cloud App Starter
Java Program to Implement Shunting Yard Algorithm
Guide to the Java Clock Class
Giới thiệu Google Guice – Dependency injection (DI) framework
Java Program to Implement Depth-limited Search
Guide to Character Encoding
Introduction to Using Thymeleaf in Spring
Allow user:password in URL
Java Program to Find the Connected Components of an UnDirected Graph
Intersection of Two Lists in Java
Tổng quan về ngôn ngữ lập trình java
Hướng dẫn Java Design Pattern – Intercepting Filter
Java Program to Solve Tower of Hanoi Problem using Stacks
Java 8 Predicate Chain
Java Program to Implement Selection Sort
Java Program to Remove the Edges in a Given Cyclic Graph such that its Linear Extension can be Found
Sorting in Java
Rest Web service: Filter và Interceptor với Jersey 2.x (P1)
Spring Data Java 8 Support
Java Program to Implement PrinterStateReasons API
Java Program to Find Number of Spanning Trees in a Complete Bipartite Graph