A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons" by Hao

The Tektosyne Library for Java provides algorithms for computational geometry and graph-based pathfinding, along with supporting mathematical utilities and specialized collections.

Code from O'Rourke book "Computational Geometry algorithms in C" 1997

An interactive program for creating polygons and determining if a given point is inside or outside the polygons

A fast 'point(s)-in-polygon' test for Python.

A numpy geometry class and functions that work with arcpy and ESRI featureclasses. Includes Free Tools for ArcGIS Pro

A fast 'point(s)-in-polygon' test for MATLAB.

Generic Polygon Operations

Fast and in memory geo lookup library

An in-memory point-in-polygon (reverse geocoding) package for GeoJSON data, principally Who's On First data.

Shortest Path Algorithms on an Ocean Routing Graph extracted from Open Street Map data.

Points inside or outside the polygon.

Ray casting point-in-polygon algorithm

Go bindings for TG Fast point-in-polygon Geometry

Python implementation of polygon-inclusion algorithm based on the winding number

A Julia package for polygon clipping.

Determine if a point lies in a 2D polygon or a 3D polyhedron.

Benthos plugins to transform geographic coordinates from a stream.

A fast points(s)-in-polygons(s) test for MATLAB.

Geometric queries (point-in-segment, point-in-polygon, polygon-in-polygon, etc.)