Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. (Q2482881)

From MaRDI portal
Revision as of 04:05, 5 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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

    Identifiers