Moser's shadow problem
From MaRDI portal
Publication:2327756
DOI10.4171/LEM/64-3/4-12zbMath1426.52004arXiv1310.4345OpenAlexW2962822367WikidataQ127445060 ScholiaQ127445060MaRDI QIDQ2327756
Arnau Padrol, Yusheng Luo, Jeffrey C. Lagarias
Publication date: 15 October 2019
Published in: L'Enseignement Mathématique. 2e Série (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.4345
Moser's shadow problem3-dimensional polytopes and polyhedrashadows and silhouettessilhouette span problem
Three-dimensional polytopes (52B10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Projective analytic geometry (51N15)
Related Items
Cites Work
- Unnamed Item
- Convex subdivisions with low stabbing numbers
- The simplex method. A probabilistic analysis
- The complexity of cutting complexes
- Problems, problems, problems
- Unsolved problems in geometry
- Erratum: A Sharp Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes
- A randomized polynomial-time simplex algorithm for linear programming
- AN EXPONENTIAL LOWER BOUND ON THE COMPLEXITY OF REGULARIZATION PATHS
- Silhouette of a random polytope
- Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method
- Smoothed analysis of algorithms
- The Average number of pivot steps required by the Simplex-Method is polynomial
- Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
- Lectures on Polytopes
- A friendly smoothed analysis of the simplex method
- Twenty Problems on Convex Polyhedra Part I
- Twenty Problems on Convex Polyhedra Part II
- Sections and projections of convex polytopes