An algorithmic approach to Rupert’s problem

DOI10.1090/MCOM/3831MaRDI QIDQ5886883zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

ArchimedeanCatalanJohnson solidsNieuwland constantPlatonicprobabilistic and deterministic algorithmsRupert's problem

Mathematics Subject Classification ID

Convex and discrete geometry (52-XX) Computer science (68-XX)

Recommendations

• Extended abstract for
• Optimizing for the Rupert Property
• Rupert properties of polyhedra and the generalised Nieuwland constant
• Rupert property of Archimedean solids
• The truncated tetrahedron is Rupert

Cites work

• Cubes and Boxes Have Rupert’s Passages in Every Nontrivial Direction
• Extended abstract for
• scientific article; zbMATH DE number 3475392 (Why is no real title available?)
• scientific article; zbMATH DE number 3061137 (Why is no real title available?)
• Largest placement of one convex polygon inside another
• Platonic Passages
• Rupert properties of polyhedra and the generalised Nieuwland constant
• Rupert property of Archimedean solids
• Solving systems of polynomial inequalities in subexponential time
• The truncated tetrahedron is Rupert

Cited in

(6)

• scientific article; zbMATH DE number 5733069 (Why is no real title available?)
• Extended abstract for
• Optimizing for the Rupert Property
• Rupert property of some particular \(n\)-simplices and \(n\)-octahedrons
• An algorithmic approach to Rupert's problem
• Some New Insights from Highly Optimized Polyhedral Passages

This page was built for publication: An algorithmic approach to Rupert’s problem

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