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.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 | //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:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 | $ 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 do a Breadth First Search/Traversal on a graph non-recursively
The Difference Between map() and flatMap()
Guide to PriorityBlockingQueue in Java
Làm thế nào tạo instance của một class mà không gọi từ khóa new?
Exploring the New Spring Cloud Gateway
Spring RequestMapping
Hướng dẫn Java Design Pattern – Service Locator
Spring Data JPA Delete and Relationships
Creating a Web Application with Spring 5
Java Program to Describe the Representation of Graph using Adjacency List
Spring Data JPA @Query
Java Program to Implement Hamiltonian Cycle Algorithm
Spring Boot - Rest Controller Unit Test
Lớp LinkedHashMap trong Java
The SpringJUnitConfig and SpringJUnitWebConfig Annotations in Spring 5
Java Program to Find the Median of two Sorted Arrays using Binary Search Approach
Java Program to Compute the Area of a Triangle Using Determinants
Spring Boot - Google Cloud Platform
Cơ chế Upcasting và Downcasting trong java
Java Program to Find Transpose of a Graph Matrix
Java Program to Implement Disjoint Set Data Structure
A Guide to JUnit 5
A Guide to TreeSet in Java
Java Program to add two large numbers using Linked List
Lập trình đa luồng với CompletableFuture trong Java 8
Java Program to Implement Fenwick Tree
Java Program to Implement ArrayDeque API
Java Program to Implement Caesar Cypher
Java CyclicBarrier vs CountDownLatch
Function trong Java 8
A Guide to the ResourceBundle
Java Program to Implement Branch and Bound Method to Perform a Combinatorial Search