An algorithmic approach to Rupert’s problem
From MaRDI portal
Publication:5886883
DOI10.1090/mcom/3831OpenAlexW4225694759MaRDI QIDQ5886883
Unnamed Author, Sergey Yurkevich
Publication date: 11 April 2023
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.13754
ArchimedeanCatalanPlatonicJohnson solidsNieuwland constantprobabilistic and deterministic algorithmsRupert's problem
Related Items (2)
Optimizing for the Rupert Property ⋮ Rupert property of some particular \(n\)-simplices and \(n\)-octahedrons
Cites Work
- Solving systems of polynomial inequalities in subexponential time
- Largest placement of one convex polygon inside another
- Rupert Property of Archimedean Solids
- Platonic Passages
- The Truncated Tetrahedron Is Rupert
- Cubes and Boxes Have Rupert’s Passages in Every Nontrivial Direction
- Extended abstract for
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An algorithmic approach to Rupert’s problem