Pages that link to "Item:Q1941218"
From MaRDI portal
The following pages link to Computing the bounded subcomplex of an unbounded polyhedron (Q1941218):
Displaying 4 items.
- Algorithms for tight spans and tropical linear spaces (Q1994124) (← links)
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q2391831) (← links)
- Vertex-facet incidences of unbounded polyhedra (Q2725173) (← links)
- Ambiguous incidences of unbounded polyhedra (Q2761100) (← links)