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 Sorted Doubly Linked List
Filtering and Transforming Collections in Guava
Java Program to Implement Shunting Yard Algorithm
Mix plain text and HTML content in a mail
Configuring a DataSource Programmatically in Spring Boot
Write/Read cookies using HTTP and Read a file from the internet
Java Program to Perform Preorder Recursive Traversal of a Given Binary Tree
Java Program to Implement Hopcroft Algorithm
Java Program to Implement AttributeList API
Java Program to Implement the Alexander Bogomolny’s UnOrdered Permutation Algorithm for Elements Fro...
Spring WebClient and OAuth2 Support
Java Program to Find the Nearest Neighbor Using K-D Tree Search
Quản lý bộ nhớ trong Java với Heap Space vs Stack
Jackson Ignore Properties on Marshalling
Java Program to Implement Naor-Reingold Pseudo Random Function
Creating a Generic Array in Java
Hướng dẫn Java Design Pattern – Chain of Responsibility
Java Program to Find Shortest Path Between All Vertices Using Floyd-Warshall’s Algorithm
Kết hợp Java Reflection và Java Annotations
An Intro to Spring Cloud Vault
Annotation trong Java 8
Guide to ThreadLocalRandom in Java
Hướng dẫn sử dụng Java Annotation
List Interface trong Java
Spring Boot - CORS Support
Java Program to Generate N Number of Passwords of Length M Each
A Guide to ConcurrentMap
Java Program to Find kth Smallest Element by the Method of Partitioning the Array
Apache Commons Collections OrderedMap
Spring Cloud Connectors and Heroku
Netflix Archaius with Various Database Configurations
Optional trong Java 8