1-Fillability Problem
A polyhedron in -space is said to be -fillable in direction provided that for every point of there is a -monotone path from it to the -maximum of . Thus, a polyhedron is -fillable if there is an orientation of in which it is -fillable. Given a simple polyhedron , decide whether or not is -fillable.
Parameters
- : number of vertices in polyhedron
Related Problems
Insufficient data to display graph
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Insuffient Data to display table
Reductions Table
Displaying 1 of 1 reductions
Other relevant algorithms
Insuffient Data to display table