Hyperplane arrangements in polymake
arXiv:2003.13548
Abstract
Hyperplane arrangements form the latest addition to the zoo of combinatorial objects dealt with by polymake. We report on their implementation and on a algorithm to compute the associated cell decomposition. The implemented algorithm performs significantly better than brute force alternatives, as it requires less convex hulls computations.
9 pages, 2 figures, 1 table