Computing the bounded subcomplex of an unbounded polyhedron (Q1941218): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.comgeo.2011.11.002 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COMGEO.2011.11.002 / rank | |||
Normal rank | |||
Latest revision as of 14:29, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the bounded subcomplex of an unbounded polyhedron |
scientific article |
Statements
Computing the bounded subcomplex of an unbounded polyhedron (English)
0 references
12 March 2013
0 references
unbounded polyhedron
0 references
bounded subcomplex
0 references
Hasse diagram
0 references
vertex-incidences
0 references
tight span
0 references
numerical examples
0 references
combinatorial algorithms
0 references
