MIConvexHull 1.1.18.1017

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 1.1.18.1017
dotnet add package MIConvexHull --version 1.1.18.1017
<PackageReference Include="MIConvexHull" Version="1.1.18.1017" />
For projects that support PackageReference, copy this XML node into the project file to reference the package.
paket add MIConvexHull --version 1.1.18.1017
The NuGet Team does not provide support for this client. Please contact its maintainers for support.

Dependencies

This package has no dependencies.

Version History

Version Downloads Last updated
1.1.19.504 97 5/4/2019
1.1.18.1017 522 2/22/2019
1.1.18.1016 4,083 10/16/2018
1.1.17.1019 11,035 10/20/2017
1.1.17.1009 238 10/10/2017
1.1.17.911 398 9/11/2017
1.1.17.412 1,492 7/27/2017
1.1.17.411 11,083 4/12/2017
1.1.17.409 227 4/9/2017
1.1.17.214 445 2/14/2017
1.1.16.905 1,104 9/5/2016
1.1.16.903 261 9/4/2016
1.0.17 265 8/26/2016
1.0.16.600 425 6/28/2016
1.0.16 684 5/29/2016
1.0.10.1045 5,057 9/16/2015
1.0.10.1021 1,833 6/4/2014