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:
Guide to ThreadLocalRandom in Java
Mapping a Dynamic JSON Object with Jackson
Java Program to Implement Interval Tree
Java Program to Compute Discrete Fourier Transform Using Naive Approach
Java 8 Predicate Chain
Java Program to Use Dynamic Programming to Solve Approximate String Matching
Overview of the java.util.concurrent
Biến trong java
Guava CharMatcher
How to Delay Code Execution in Java
JUnit 5 for Kotlin Developers
Composition, Aggregation, and Association in Java
Join and Split Arrays and Collections in Java
Java Program to Perform Uniform Binary Search
Java – Random Long, Float, Integer and Double
Logout in an OAuth Secured Application
Partition a List in Java
Giới thiệu Design Patterns
Java Program to Find the Minimum value of Binary Search Tree
Spring MVC Custom Validation
A Guide to EnumMap
Injecting Prototype Beans into a Singleton Instance in Spring
Comparing Two HashMaps in Java
Lập trình đa luồng với Callable và Future trong Java
Hướng dẫn Java Design Pattern – Strategy
Guide to Java Instrumentation
Java Program to Find Location of a Point Placed in Three Dimensions Using K-D Trees
Java Program to Represent Graph Using Adjacency Matrix
Java Program to Perform Naive String Matching
Java Program to Check Cycle in a Graph using Topological Sort
Spring Security Remember Me
Java Program to Perform Inorder Recursive Traversal of a Given Binary Tree