The Tektosyne Library for Java provides algorithms for computational geometry and graph-based pathfinding, along with supporting mathematical utilities and specialized collections.
-
Updated
Jul 19, 2021 - Java
The Tektosyne Library for Java provides algorithms for computational geometry and graph-based pathfinding, along with supporting mathematical utilities and specialized collections.
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 MATLAB.
A numpy geometry class and functions that work with arcpy and ESRI featureclasses. Includes Free Tools for ArcGIS Pro
Code from O'Rourke book "Computational Geometry algorithms in C" 1997
A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons" by Hao
A fast 'point(s)-in-polygon' test for Python.
An in-memory point-in-polygon (reverse geocoding) package for GeoJSON data, principally Who's On First data.
Ray casting point-in-polygon algorithm
🌐 Go implementation Point-In-Polygon Algorithm
A Julia package for polygon clipping.
Python implementation of polygon-inclusion algorithm based on the winding number
A fast points(s)-in-polygons(s) test for MATLAB.
In this repository, we include algorithms that are in the field of Computer Graphics and related topics.
A small module to generate a point in a polygon in O(n) time.
A loose grab-bag of python scripts I've used to help deal with KML files and other mapping-related shenanigans
Add a description, image, and links to the point-in-polygon topic page so that developers can more easily learn about it.
To associate your repository with the point-in-polygon topic, visit your repo's landing page and select "manage topics."