Estimating the number of vertices of a polyhedron

DOI10.1016/S0020-0190(00)00011-9zbMath1014.68200OpenAlexW2123276592MaRDI QIDQ1607035

David Avis, Luc P. Devroye

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00011-9

zbMATH Keywords

polyhedrontree estimation methods

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

\texttt{mplrs}: a scalable parallel vertex/facet enumeration code ⋮ Counting vertices of integral polytopes defined by facets ⋮ Stochastic enumeration method for counting trees

Uses Software

• cdd
• ZRAM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• An optimal convex hull algorithm in any fixed dimension
• McMullen's conditions and some lower bounds for general convex polytopes
• The parallel search bench ZRAM and its applications
• Reverse search for enumeration
• Estimating the Efficiency of Backtrack Programs
• Combinatorial Analysis and Computers