Hyperplane arrangements in \texttt{polymake}
From MaRDI portal
Publication:5041056
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1383707 (Why is no real title available?)
- Deformations of Coxeter hyperplane arrangements
- From the zonotope construction to the Minkowski addition of convex polytopes
- Lectures on Polytopes
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- The parallel search bench ZRAM and its applications
- Variation of geometric invariant theory quotients. (With an appendix: ``An example of a thick wall by Nicolas Ressayre)
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- polymake: a framework for analyzing convex polytopes
Cited in
(10)- Hyperplane arrangements in CoCoA
- Computing arrangements of hypersurfaces
- Computing characteristic polynomials of hyperplane arrangements with symmetries
- Efficient mode enumeration of compositional hybrid systems
- Drawing polytopal graphs with {\texttt{polymake}}
- On the geometry of flag Hilbert-Poincaré series for matroids
- On the geometry of flag Hilbert-Poincaré series for matroids
- Affine dimers from characteristic polygons
- scientific article; zbMATH DE number 7616119 (Why is no real title available?)
- Computing tropical bitangents to smooth quartic curves in polymake
This page was built for publication: Hyperplane arrangements in \texttt{polymake}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041056)