Abstract
AbstractWe investigate the intersection body of a convex polytope using tools from combinatorics and real algebraic geometry. In particular, we show that the intersection body of a polytope is always a semialgebraic set and provide an algorithm for its computation. Moreover, we compute the irreducible components of the algebraic boundary and provide an upper bound for the degree of these components.
Funder
Max Planck Institute for Mathematics in the Sciences
Publisher
Springer Science and Business Media LLC
Subject
Geometry and Topology,Algebra and Number Theory
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The best ways to slice a polytope;MATH COMPUT;2024-07-19
2. Intersection bodies of polytopes: translations and convexity;Journal of Algebraic Combinatorics;2024-05-09
3. Correction to: Intersection bodies of polytopes;Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry;2022-03-23