Processing Convex Hull

An example of finding the convex hull containing a set of points. Algorithm from Computational Geometry by de Berg, et al
Alternatives To Processing Convex Hull
Project NameStarsDownloadsRepos Using ThisPackages Using ThisMost Recent CommitTotal ReleasesLatest ReleaseOpen IssuesLicenseLanguage
Algorithms16,429
2 months ago108mitJava
A collection of algorithms and data structures
Cgal4,374
3 months ago523otherC++
The public CGAL repository, see the README below
Clipper21,07513 months ago10November 28, 2023bsl-1.0C++
Polygon Clipping and Offsetting - C++, C# and Delphi
Earcut.hpp779
3 months ago10iscC
Fast, header-only polygon triangulation
Scikit Geometry392
5 months ago1July 07, 202045lgpl-3.0Jupyter Notebook
Scientific Python Geometric Algorithms Library
Cavaliercontours266
a year ago24mitC++
2D polyline library for offsetting, combining, etc.
Gogeos212275 years ago3May 29, 201418mitGo
Go library for spatial data operations and geometric algorithms (Go bindings for GEOS)
Delaunator Rs16876 months ago7March 21, 20232iscRust
Fast 2D Delaunay triangulation in Rust. A port of Delaunator.
Rrt Algorithms125
4 years ago7mitPython
n-dimensional RRT, RRT* (RRT-Star)
Rgeometry113
a year ago11August 13, 202218unlicenseRust
Computational Geometry library written in Rust
Alternatives To Processing Convex Hull
Select To Compare


Alternative Project Comparisons
Popular Geometry Projects
Popular Algorithms Projects
Popular Mathematics Categories

Get A Weekly Email With Trending Projects For These Categories
No Spam. Unsubscribe easily at any time.
Java
Algorithms
Geometry
Computational Geometry