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.

Install-Package MIConvexHull -Version
dotnet add package MIConvexHull --version
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.

Version History

Version Downloads Last updated 1,460 10/16/2018 10,246 10/20/2017 203 10/10/2017 362 9/11/2017 1,455 7/27/2017 9,891 4/12/2017 193 4/9/2017 407 2/14/2017 1,050 9/5/2016 228 9/4/2016
1.0.17 231 8/26/2016 389 6/28/2016
1.0.16 604 5/29/2016 5,005 9/16/2015 1,791 6/4/2014