Combinatorial face enumeration in convex polytopes

DOI10.1016/0925-7721(94)90017-5zbMath0811.68119OpenAlexW2055018987MaRDI QIDQ1334609

Komei Fukuda, Vera Rosta

Publication date: 25 September 1994

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(94)90017-5

zbMATH Keywords

convex polytopecombinatorial face enumeration problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) (n)-dimensional polytopes (52B11) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Polyhedral omega: a new algorithm for solving linear Diophantine systems, On planar path transformation, Segments in enumerating faces, Algebraic and numerical techniques for the computation of matrix determinants, Compression with wildcards: Abstract simplicial complexes, The Minkowski sum of simplices in 3-dimensional space. An analytical description, Scenario-based portfolio model for building robust and proactive strategies, Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis., Compactness criteria for real algebraic sets and Newton polyhedra, The aggregate capacity of virtual resources – linear models, A validation and verification tool for global optimization solvers, On local transformation of polygons with visibility properties., Linearly constrained global optimization: a general solution algorithm with applications., Computing the face lattice of a polytope from its vertex-facet incidences

Uses Software

• VertexEnumeration

Cites Work

• Unnamed Item
• Unnamed Item
• A simple way to tell a simple polytope from its graph
• Combinatorial face enumeration in arrangements and oriented matroids
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra