1-Fillability Problem

A polyhedron PP in 33-space is said to be 11-fillable in direction z-z provided that for every point of PP there is a +z+z-monotone path from it to the zz-maximum of PP. Thus, a polyhedron is 11-fillable if there is an orientation of PP in which it is 11-fillable. Given a simple polyhedron PP, decide whether or not PP is 11-fillable.

Parameters

  • nn: 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