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 Unrolled Linked List
Working with Tree Model Nodes in Jackson
Java Program to Implement Hash Tables with Quadratic Probing
JUnit 5 @Test Annotation
Java Program to Implement Iterative Deepening
ThreadPoolTaskExecutor corePoolSize vs. maxPoolSize
Java Program to Check Whether a Weak Link i.e. Articulation Vertex Exists in a Graph
Tránh lỗi ConcurrentModificationException trong Java như thế nào?
Java Program to Implement Skew Heap
So sánh Array và ArrayList trong Java
Spring Boot - Zuul Proxy Server and Routing
Java Program to Implement Max-Flow Min-Cut Theorem
Java Program to Implement Shunting Yard Algorithm
Handling URL Encoded Form Data in Spring REST
Prevent Brute Force Authentication Attempts with Spring Security
Migrating from JUnit 4 to JUnit 5
Java Program to Implement Binary Tree
Spring MVC + Thymeleaf 3.0: New Features
Spring Boot: Customize Whitelabel Error Page
Using a List of Values in a JdbcTemplate IN Clause
New Features in Java 9
OAuth2 for a Spring REST API – Handle the Refresh Token in AngularJS
A Guide to the ViewResolver in Spring MVC
Java Program to Implement Graph Structured Stack
Giới thiệu Java Service Provider Interface (SPI) – Tạo các ứng dụng Java dễ mở rộng
Extract links from an HTML page
Java Program to Implement Sparse Array
Java Program to Implement the Schonhage-Strassen Algorithm for Multiplication of Two Numbers
Java Program to Implement Uniform-Cost Search
Java Program to Implement Queue
New Features in Java 13
Immutable ArrayList in Java