This project is a convex hull algorithm and library for 2D,  3D, and higher dimensions. The code can also be used to compute Delaunay triangulations and Voronoi meshes of the input data. The benchmarks indicate that the convex hull code and 4 and higher dimensional triangulation code is on par or better than the solution provided by the C++ library CGAL.
The code is written in C# 4.0 (or .NET Standard 1.0) and provides a template based API that allows extensive customization of the underlying types that represents vertices and faces of the convex hull. The algorithm itself is technically an implementation of the QuickHull algorithm. Nevertheless, it's not just a simple port of QHull as a different approach and data structures are used in the MIConvexHull algorithm.

There is a newer version of this package available.
See the version list below for details.
Install-Package MIConvexHull -Version
dotnet add package MIConvexHull --version
<PackageReference Include="MIConvexHull" Version="" />
For projects that support PackageReference, copy this XML node into the project file to reference the package.
paket add MIConvexHull --version
The NuGet Team does not provide support for this client. Please contact its maintainers for support.


This package has no dependencies.

Showing the top 5 GitHub repositories that depend on MIConvexHull:

Repository Stars
Open Source Graphical Programming for Design
Re-implementation of The Sims Online.
3D printing software for Windows, Mac and Linux
Code for the paper "OpenAI Remote Rendering Backend"
A C# port of Anti-Grain Geometry (AGG) with extensions for common scenarios

Version History

Version Downloads Last updated 20 8/20/2019 116 8/3/2019 60 8/2/2019 58 7/30/2019 525 5/4/2019 999 2/22/2019 5,814 10/16/2018 11,844 10/20/2017 281 10/10/2017 430 9/11/2017 1,571 7/27/2017 13,142 4/12/2017 263 4/9/2017 490 2/14/2017 1,167 9/5/2016 320 9/4/2016
1.0.17 312 8/26/2016 483 6/28/2016
1.0.16 737 5/29/2016 5,119 9/16/2015 1,894 6/4/2014