Hyperplane arrangements in polymake

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...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2020-03
Main Authors: Kastner, Lars, Panizzut, Marta
Format: Article
Language:English
Subjects:
Algorithms
Combinatorial analysis
Computational geometry
Convexity
Hulls
Hyperplanes
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422