The upper bound theorem for polytopes: An easy proof of its asymptotic version

DOI10.1016/0925-7721(95)00013-YzbMATH Open0831.68114DBLPjournals/comgeo/Seidel95OpenAlexW2088501747WikidataQ56047087 ScholiaQ56047087MaRDI QIDQ1900993FDOQ1900993

Authors: Raimund Seidel 

Publication date: 29 October 1995

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

Full work available at URL: https://doi.org/10.1016/0925-7721(95)00013-y

Recommendations

• An Upper Bound Theorem for Polytope Pairs
• An upper bound theorem for rational polytopes
• An upper bound theorem concerning lattice polytopes
• scientific article; zbMATH DE number 7203478
• Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
• An asymptotically improved upper bound on the diameter of polyhedra
• Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
• A proof of Grünbaum's lower bound conjecture for general polytopes
• Lower bound theorems for general polytopes
• A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes

zbMATH Keywords

\(d\)-polytope

Mathematics Subject Classification ID

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

Cites Work

• Lectures on Polytopes
• Title not available (Why is that?)
• The maximum numbers of faces of a convex polytope
• On the Number of Vertices of a Convex Polytope

Cited In (26)

• Variance-based simplex stochastic collocation with model order reduction for high-dimensional systems
• A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector
• Relative persistent homology
• Title not available (Why is that?)
• Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations
• Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
• Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
• Ready, set, go! The Voronoi diagram of moving points that start from a line
• Qualification Conditions in Semialgebraic Programming
• The Morse theory of Čech and Delaunay complexes
• Note on the complexity of the mixed-integer hull of a polyhedron
• The minimum convex container of two convex polytopes under translations
• PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS
• A proof of Grünbaum's lower bound conjecture for general polytopes
• On the Monotone Upper Bound Problem
• How the upper bound conjecture was proved
• Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
• Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls
• Exact Quantization of Multistage Stochastic Linear Problems
• An Upper Bound Theorem for Polytope Pairs
• Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
• Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls
• McMullen's conditions and some lower bounds for general convex polytopes
• Classification using proximity catch digraphs
• Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
• An upper bound on the shortness exponent of inscribable polytopes

This page was built for publication: The upper bound theorem for polytopes: An easy proof of its asymptotic version

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900993)