Papers › An algorithm to reconstruct convex polyhedra from their face normals and areas
An algorithm to reconstruct convex polyhedra from their face normals and areas
Giuseppe Sellaroli
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron associated to given face normals and areas, but does not provide a constructive way to find it explicitly. This article provides an algorithm to reconstruct 3D convex polyhedra from their face normals and areas, based on an method by Lasserre to compute the volume of a convex polyhedron in ℝⁿ. A Python implementation of the algorithm is available at https://github.com/gsellaroli/polyhedrec.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections