Pages that link to "Item:Q1367169"
From MaRDI portal
The following pages link to On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (Q1367169):
Displaying 15 items.
- Computing cup products in \(\mathbb{Z}_2\)-cohomology of 3D polyhedral complexes (Q404268) (← links)
- Small grid embeddings of 3-polytopes (Q629826) (← links)
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
- A duality transform for constructing small grid embeddings of 3d polytopes (Q679743) (← links)
- Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets (Q967409) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- Computational complexity of the vertex cover problem in the class of planar triangulations (Q1744983) (← links)
- On the geometric interpretation of the nonnegative rank (Q1758469) (← links)
- A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector (Q1983109) (← links)
- Sparse convex hull coverage (Q2230408) (← links)
- Embedding stacked polytopes on a polynomial-size grid (Q2358818) (← links)
- Skyscraper polytopes and realizations of plane triangulations (Q2407381) (← links)
- Cup Products on Polyhedral Approximations of 3D Digital Images (Q3003527) (← links)
- Realizing Planar Graphs as Convex Polytopes (Q3223957) (← links)
- SEPARABILITY OF POINT SETS BY k-LEVEL LINEAR CLASSIFICATION TREES (Q4650094) (← links)
