Related papers: Linear programs and convex hulls over fields of Pu…
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
We examine implicit representations of parametric or point cloud models, based on interpolation matrices, which are not sensitive to base points. We show how interpolation matrices can be used for ray shooting of a parametric ray with a…
A high-level description of an algorithm which computes the minimum perimeter triangle enclosing a convex polygon in linear time exists in the literature. Besides that an implementation of the algorithm is given in the subsequent work.…
Let $P$ be a crossing-free polygon and $\mathcal C$ a set of shortcuts, where each shortcut is a directed straight-line segment connecting two vertices of $P$. A shortcut hull of $P$ is another crossing-free polygon that encloses $P$ and…
For certain tropical quartic curves the existing techniques could not predict the lifting behavior of their bitangents over the real numbers. We close this gap by using patchworking techniques. Further, this paper provides an analysis of…
The aim of this paper is to give a constructive proof of one of the basic theorems of tropical geometry: given a point on a tropical variety (defined using initial ideals), there exists a Puiseux-valued ``lift'' of this point in the…
We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs in the plane. We also prove that the split closure of a polyhedron in the plane has polynomial size.
In this article we encode Hadwiger's covering conjecture and Borsuk's partition conjecture into continuous functions defined on the spaces of convex bodies, propose a four-step program to approach them, and obtain some partial results.
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
In this paper we discuss the variety of planar spiral segments and their applications in objects in both the real and artificial world. The discussed curves with monotonic curvature function are well-known in geometric modelling and…
Puiseux series are power series in which the exponents can be fractional and/or negative rational numbers. Several computer algebra systems have one or more built-in or loadable functions for computing truncated Puiseux series. Some are…
Tropical geometry is a piecewise linear "shadow" of algebraic geometry. It allows for the computation of several cohomological invariants of an algebraic variety. In particular, its application to enumerative algebraic geometry led to…
We show that any accordion complex associated to a dissection of a convex polygon is isomorphic to the support $\tau$-tilting simplicial complex of an explicit finite dimensional algebra. To this end, we prove a property of some induced…
In this survey, we discuss linear series on tropical curves and their relation to classical algebraic geometry, describe the main techniques of the subject, and survey some of the recent major developments in the field, with an emphasis on…
Spline functions have long been used in numerical solution of differential equations. Recently it revives as isogeometric analysis, which offers integration of finite element analysis and NURBS based CAD into a single unified process.…
We introduce a natural notion of depth that applies to individual cutting planes as well as entire families. This depth has nice properties that make it easy to work with theoretically, and we argue that it is a good proxy for the practical…
Field Arithmetic studies the interplay between arithmetical properties of fields and their absolute Galois groups. Here we studies fields satisfying local global principles for rational points of varieties and profinite groups satisfying…
Convexity prior is one of the main cue for human vision and shape completion with important applications in image processing, computer vision. This paper focuses on characterization methods for convex objects and applications in image…
A large family of linear, usually overdetermined, systems of partial differential equations that admit a multiplication of solutions, i.e, a bi-linear and commutative mapping on the solution space, is studied. This family of PDE's contains…