Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. (Q2482881): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0925-7721(95)00049-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2150961023 / rank | |||
Normal rank | |||
Revision as of 14:29, 19 March 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
