Point in polygon - Check if the point inside the polygon
Switch branches/tags
Nothing to show
Clone or download
Latest commit e5717ff Sep 12, 2017
Type Name Latest commit message Commit time
Failed to load latest commit information.
.idea Added gradle Jul 2, 2017
assets Update readme Apr 17, 2016
gradle/wrapper Updated package, added tests. Fix #1 and #3 Jul 2, 2017
src Added new test. issue #12 Sep 12, 2017
.gitignore Added gradle Jul 2, 2017
LICENSE added license Nov 26, 2013
README.md Update readme Jul 2, 2017
build.gradle LICENSE file inside the JAR Sep 11, 2017
gradlew Added gradle Jul 2, 2017
gradlew.bat Added gradle Jul 2, 2017
settings.gradle Added gradle Jul 2, 2017



The point-in-polygon (PIP) problem asks whether a given point in the plane lies inside, outside, or on the boundary of a polygon. Wiki reference: Point in polygon

Latest Release

📥 Download - polygon-1.0.2.jar

📑 Changelog - https://github.com/sromku/polygon-contains-point/releases/latest


The number of intersections for a ray passing from the exterior of the polygon to any point; if odd, it shows that the point lies inside the polygon. If it is even, the point lies outside the polygon.


Build Polygon

This is the simple version of the polygon. You can build both types of polygons: concave and non-convex

Polygon polygon = Polygon.Builder()
        .addVertex(new Point(1, 3))
        .addVertex(new Point(2, 8))
        .addVertex(new Point(5, 4))
        .addVertex(new Point(5, 9))
        .addVertex(new Point(7, 5))
        .addVertex(new Point(6, 1))
        .addVertex(new Point(3, 1))

Build Polygon with Holes

First build all the border sides of the polygon. Close the borders and then you can start adding holes into the polygon. You can add multiple number of holes, just remember to close() after each added hole.

Polygon polygon = Polygon.Builder()
        .addVertex(new Point(1, 2)) // polygon
        .addVertex(new Point(1, 6))
        .addVertex(new Point(8, 7))
        .addVertex(new Point(8, 1))
        .addVertex(new Point(2, 3)) // hole one
        .addVertex(new Point(5, 5))
        .addVertex(new Point(6, 2))
        .addVertex(new Point(6, 6)) // hole two
        .addVertex(new Point(7, 6))
        .addVertex(new Point(7, 5))

Check if the point inside

Point point = new Point(4.5f, 7);
boolean contains = polygon.contains(point);


Two main tests are attached (not in junit format). Both tests cover polygons with holes and without.


Apache 2.0. See LICENSE

Follow us

Twitter URL Twitter Follow