Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/sromku/polygon-contains-point
Point in polygon - Check if the point inside the polygon
https://github.com/sromku/polygon-contains-point
java polygons
Last synced: 7 days ago
JSON representation
Point in polygon - Check if the point inside the polygon
- Host: GitHub
- URL: https://github.com/sromku/polygon-contains-point
- Owner: sromku
- License: other
- Archived: true
- Created: 2013-03-01T21:39:56.000Z (over 11 years ago)
- Default Branch: master
- Last Pushed: 2019-03-25T17:10:36.000Z (over 5 years ago)
- Last Synced: 2024-08-02T16:47:27.372Z (3 months ago)
- Topics: java, polygons
- Language: Java
- Size: 104 KB
- Stars: 294
- Watchers: 17
- Forks: 102
- Open Issues: 8
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
polygon-contains-point
======================
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](http://en.wikipedia.org/wiki/Point_in_polygon)
## Latest Release
:inbox_tray: Download - [polygon-1.0.2.jar](https://github.com/sromku/polygon-contains-point/releases/download/1.0.2/polygon-1.0.2.jar)
:bookmark_tabs: Changelog - https://github.com/sromku/polygon-contains-point/releases/latest
## Algorith
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.
## Usage
### Build Polygon
This is the simple version of the polygon. You can build both types of polygons: [concave and non-convex](http://en.wikipedia.org/wiki/Convex_and_concave_polygons)
``` java
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();
```
### 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.
``` java
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))
.close()
.addVertex(new Point(2, 3)) // hole one
.addVertex(new Point(5, 5))
.addVertex(new Point(6, 2))
.close()
.addVertex(new Point(6, 6)) // hole two
.addVertex(new Point(7, 6))
.addVertex(new Point(7, 5))
.build();
```
### Check if the point inside
``` java
Point point = new Point(4.5f, 7);
boolean contains = polygon.contains(point);
```
## Tests
Two main tests are attached (not in junit format). Both tests cover polygons with holes and without.
## License
Apache 2.0. See [LICENSE](LICENSE)
## Follow us
[](https://twitter.com/intent/tweet?text=https://github.com/snatik/polygon-contains-point)
[](https://twitter.com/snatikteam)