Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. (Q2482881): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:47, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. |
scientific article |
Statements
Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. (English)
0 references
25 April 2008
0 references
vertex enumeration problem
0 references
face enumeration problem
0 references
restricted vertex problem
0 references
optimal vertex problems for polyhedra
0 references
arrangements of hyperplanes
0 references
