Convex hull generation in .NET.

Question

I have a bunch of three-dimensional vertex positions and you need to create a convex hull containing them; Does anyone know any QHull bindings for .NET? or Delaunay’s own 3D triangulation algorithms?

Answer 1

3D Delaunay is complicated, I'm not sure that it is even possible to strictly define the Delaunay constraint for a 3D surface.
The usual method, if you just want to create a grid on the surface, is to select a direction and display it at 2 coordinates and perform a 2-dimensional delay. It's easy to use x, y for a height map. Then, when you have the nodes that make up each triangle, you can of course use their three-dimensional coordinates.

2D-, , http://www.cs.cmu.edu/~quake/triangle.html

Answer 2

, MI Convex Hull: https://miconvexhull.codeplex.com/

Answer 3

Check out this site , which requires a search for 2D and 3D points in shapes.

Answer 4

Since this is Google’s top hit for the “convex hull generation”, I want to point out to readers the Stan Melax hull generation code. It was packaged by John Ratcliff as "stanhull". Easier to work with QHull.

Edit: A link to stanhull