An explicit finite cylinder cover of the regular tetrahedron saving 3.86×10⁻⁴ below the half-area bound

We give an explicit cover of a regular tetrahedron by 4096 cylinders with compact triangular perpendicular bases. The sum of their base areas, divided by the tetrahedron's minimum orthogonal projection area, lies in [0.499613830783714148, 0.499613830783714149). Thus the saving below 1/2 exceeds 0.000386169216285851. The construction uses a finite tilt in the angular-sector framework of OpenAI's September 2026 preprint and rationally specified radial cutoffs. Coverage is certified by exact linear-programming dual witnesses, and independently verified by exhaustive rational polyhedron clipping. We describe the geometric reduction, the certificate obligations, and reproducible verification of the full closed tetrahedron and the perpendicular base areas. No optimality is asserted.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-19
DOI
https://doi.org/10.5281/zenodo.23483538
Primary Topic
Computational Geometry and Mesh Generation
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

An explicit finite cylinder cover of the regular tetrahedron saving 3.86×10⁻⁴ below the half-area bound

Ricardo Pinho
Zenodo (CERN European Organization for Nuclear Research)
Computational Geometry and Mesh Generation
preprint

An explicit finite cylinder cover of the regular tetrahedron saving 3.86×10⁻⁴ below the half-area bound

Ricardo Pinho
preprint en

Abstract

We give an explicit cover of a regular tetrahedron by 4096 cylinders with compact triangular perpendicular bases. The sum of their base areas, divided by the tetrahedron's minimum orthogonal projection area, lies in [0.499613830783714148, 0.499613830783714149). Thus the saving below 1/2 exceeds 0.000386169216285851. The construction uses a finite tilt in the angular-sector framework of OpenAI's September 2026 preprint and rationally specified radial cutoffs. Coverage is certified by exact linear-programming dual witnesses, and independently verified by exhaustive rational polyhedron clipping. We describe the geometric reduction, the certificate obligations, and reproducible verification of the full closed tetrahedron and the perpendicular base areas. No optimality is asserted.

Zenodo (CERN European Organization for Nuclear Research)
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.