Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes.

Emily Speakman Gennadiy Averkov

Published in: Discret. Appl. Math. (2022)

Keyphrases

convex hull
point sets
convex sets
data points
minimum distance
integer points
convex polyhedra
linear inequalities
feasible solution
computational geometry
mixed integer
finite set of points
voronoi diagram
multiple views
three dimensional
extreme points
training samples
lower bound
feature space