Hyperplane arrangements in polymake

03/30/2020
by   Lars Kastner, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/29/2010

The Application of a Dendritic Cell Algorithm to a Robotic Classifier

The dendritic cell algorithm is an immune-inspired technique for process...
research
04/22/2017

CAD Adjacency Computation Using Validated Numerics

We present an algorithm for computation of cell adjacencies for well-bas...
research
03/28/2017

Simulated Data Experiments for Time Series Classification Part 1: Accuracy Comparison with Default Settings

There are now a broad range of time series classification (TSC) algorith...
research
08/28/2019

Streaming and Batch Algorithms for Truss Decomposition

Truss decomposition is a method used to analyze large sparse graphs in o...
research
12/03/2017

An algorithm to reconstruct convex polyhedra from their face normals and areas

A well-known result in the study of convex polyhedra, due to Minkowski, ...
research
10/07/2009

Parallel local search for solving Constraint Problems on the Cell Broadband Engine (Preliminary Results)

We explore the use of the Cell Broadband Engine (Cell/BE for short) for ...
research
01/21/2021

A variational discrete element method for the computation of Cosserat elasticity

The variational discrete element method developed in [Marazzato et al, 2...

Please sign up or login with your details

Forgot password? Click here to reset