Skip to content

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

3D Polytope volume

This algorithm compute fastly the volume of a convex polytope through a set of points.

The header is as simple as that.

typedef struct ConvexHull {
	int i0;
	int i1;
	int i2;
	double n[4];
	struct ConvexHull * next;
} ConvexHull;

double volume(double * X, double * Y, double * Z, int nb_points);

alt text

alt text

alt text

alt text

alt text

alt text

alt text

Releases

Packages

Contributors

Languages