{"id":"openai-math/Finite-triangular-approximation-of-radial-sweeps","pdf":"https://github.com/openai/math/blob/main/preprints/Finite-triangular-approximation-of-radial-sweeps-September-27-2026/main.pdf","url":"https://github.com/openai/math/tree/main/preprints/Finite-triangular-approximation-of-radial-sweeps-September-27-2026","tags":["convex-geometry","covering-problems","tetrahedra"],"score":0,"title":"Finite triangular approximation of radial sweeps","domain":"Convex and metric geometry","family":"100","origin":"ai-generated","source":"openai-math","authors":["OpenAI"],"reviews":0,"subject":"math.MG","summary":"We prove that radially aligned segment sweeps admit finite cylinder covers with one triangular base for each interval of any tagged partition. As the mesh tends to zero, the total perpendicular base area converges to a weighted parameter area. An explicit application covers every regular tetrahedron with total base area below half its minimum projection area, giving negative answers to the half-area question and the directionwise normalized 1-Codimensional Cylinder Covering Conjecture.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-09-27","reactions":{},"formalized":false,"family_title":"Cylinder coverings below the half-area bound"}