A lower bound for splines on tetrahedral vertex stars.
Michael DiPasqualeNelly VillamizarPublished in: CoRR (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- np hard
- branch and bound
- b spline
- lower and upper bounds
- shape preserving
- optimal solution
- volume rendering
- objective function
- finite element
- lower bounding
- worst case
- closed form
- sufficiently accurate
- polynomial approximation
- branch and bound method
- minimum weight
- cubic spline
- directed graph
- concept class
- upper and lower bounds
- linear programming
- constant factor
- randomized algorithm
- vc dimension
- sample complexity
- integer programming
- genetic algorithm