Login / Signup
cMinMax: A Fast Algorithm to Find the Corners of an N-dimensional Convex Polytope.
Dimitrios Chamzas
Constantinos Chamzas
Konstantinos Moustakas
Published in:
VISIGRAPP (1: GRAPP) (2021)
Keyphrases
</>
convex hull
semidefinite
lattice points
multi dimensional
convex sets
corner detection
stable set
scale space
convex relaxation
convex programming
globally optimal
extreme points
multiscale
sufficient conditions
risk minimization
corner points