Related papers: Hyperplane arrangements in polymake
This paper improves the algorithms based on supporting halfspaces and quadratic programming for convex set intersection problems in our earlier paper in several directions. First, we give conditions so that much smaller quadratic programs…
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
The multiplication of matrices is an important arithmetic operation in computational mathematics. In the context of hierarchical matrices, this operation can be realized by the multiplication of structured block-wise low-rank matrices,…
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon becomes intractable. In this paper we present a novel form of…
The Grassmannian, which is the manifold of all $k$-dimensional subspaces in the Euclidean space $\mathbb{R}^n$, was decomposed through three equivalent methods connecting combinatorial geometries, Schubert cells and convex polyhedra by…
This contribution presents a hierarchical multigrid approach for the solution of large-scale finite cell problems on both uniform grids and multi-level hp-discretizations. The proposed scheme leverages the hierarchical nature of the basis…
We devise a Hybrid High-Order (HHO) method for highly oscillatory elliptic problems that is capable of handling general meshes. The method hinges on discrete unknowns that are polynomials attached to the faces and cells of a coarse mesh;…
Writing an uncomplicated, robust, and scalable three-dimensional convex hull algorithm is challenging and problematic. This includes, coplanar and collinear issues, numerical accuracy, performance, and complexity trade-offs. While there are…
A toric hyperplane is the preimage of a point $x \in S^1$ of a continuous surjective group homomorphism $\theta: \mathbb{T}^n \to S^1$. A finite hyperplane arrangement is a finite collection of such hyperplanes. In this paper, we study the…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
In a previous work a procedure was decribed for dividing the $3 \times N$-dimensional conformational space of a molecular system into a number of discrete cells, this partition allowed the building of a combinatorial structure from data…
Optimal recursive decomposition (or DR-planning) is crucial for analyzing, designing, solving or finding realizations of geometric constraint sytems. While the optimal DR-planning problem is NP-hard even for general 2D bar-joint constraint…
Using concepts and techniques of bilinear algebra, we construct hyperbolic planes over a euclidean ordered field that satisfy all the Hilbert axioms of incidence, order and congruence for a basic plane geometry, but for which the hyperbolic…
The cohomology on the complement of hyperplanes with the coefficients in the rank one local system associated to a generic weight vanishes except in the highest dimension. In this paper, we construct matroids or arrangements and its weights…
We consider the behaviour of logarithmic differential forms on arrangements and multiarrangements of hyperplanes under the operations of deletion and restriction, extending early work of G\"unter Ziegler. The restriction of logarithmic…
This paper presents a family of new methods for locating/fitting hyperplanes with respect to a given set of points. We introduce a general framework for a family of aggregation criteria of different distance-based errors. The most popular…
The multi-level hp-refinement scheme is a powerful extension of the finite element method that allows local mesh adaptation without the trouble of constraining hanging nodes. This is achieved through hierarchical high-order overlay meshes,…
Many forms of programmable matter have been proposed for various tasks. We use an abstract model of self-organizing particle systems for programmable matter which could be used for a variety of applications, including smart paint and…
The cutting plane approach to optimal matchings has been discussed by several authors over the past decades (e.g., Padberg and Rao '82, Grotschel and Holland '85, Lovasz and Plummer '86, Trick '87, Fischetti and Lodi '07) and its…