×
Aug 24, 2013 · Implementing the 3D convex hull is not easy, but many algorithms have been implemented, and code is widely available.
People also ask
Apr 1, 2015 · What your thinking of is downscaling the 3D convex hull, it works just like downscaling a 2D image, except for how the angle.
Jul 28, 2013 · You know the points are vertices of the polyhedron. Do you know the faces (polygons on the hull)? If so you can compute the volume rather easily ...
Parameters: pointsndarray of floats, shape (npoints, ndim). Coordinates of points to construct a convex hull from. incrementalbool, optional.
In order to show you the most relevant results, we have omitted some entries very similar to the 8 already displayed. If you like, you can repeat the search with the omitted results included.