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.

中文翻译：

---

polymake 中的超平面排列

超平面排列构成了由 polymake 处理的组合对象动物园的最新成员。我们报告了它们的实现和计算相关单元分解的算法。所实现的算法的性能明显优于蛮力替代方案，因为它需要更少的凸包计算。