Related papers: Planar convex codes are decidable

The brain encodes spacial structure through a combinatorial code of neural activity. Experiments suggest such codes correspond to convex areas of the subject's environment. We present an intrinsic condition that implies a neural code may…

In this paper we introduce a technique to produce tighter cutting planes for mixed-integer non-linear programs. Usually, a cutting plane is generated to cut off a specific infeasible point. The underlying idea is to use the infeasible point…

A {\em convex hole} (or {\em empty convex polygon)} of a point set $P$ in the plane is a convex polygon with vertices in $P$, containing no points of $P$ in its interior. Let $R$ be a bounded convex region in the plane. We show that the…

We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…

We show that convex pentagons that can generate edge-to-edge monohedral tilings of the plane can be classified into exactly eight types. Using these results, it is also proved that no single convex polygon can be an aperiodic prototile…

A (convex) polytope $P$ is said to be $2$-level if for every direction of hyperplanes which is facet-defining for $P$, the vertices of $P$ can be covered with two hyperplanes of that direction. The study of these polytopes is motivated by…

Given a set P of points on the plane, a polygon with vertices in P is said to be empty if it contains no element of P in its interior. We show that every set of n points in general position on the plane determines at least…

We give an overview of the 2020 Computational Geometry Challenge, which targeted the problem of partitioning the convex hull of a given planar point set P into the smallest number of convex faces, such that no point of P is contained in the…

Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a simple polygon, is considered. Given a point set in the plane…

We study the problem of determining whether a given frame is scalable, and when it is, understanding the set of all possible scalings. We show that for most frames this is a relatively simple task in that the frame is either not scalable or…

Nonsingular projective varieties which are both convex and rationally connected are considered. We ask whether such varieties must be algebraic homogeneous spaces G/P. In case X is a complete intersection, an affirmative answer is obtained…

When the plane is pie-sliced in $n\leq 4$ parts (with nonempty interior and common vertex at the origin) our main result provides a sufficient condition for any map $L$, that is continuous and piecewise linear relatively to this slicing, to…

Let $B$ be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most one, and let $P$ be a convex polygon with $n$ vertices. Given a starting configuration (a location and a direction of travel)…

Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with…

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

The aim of this work is to prove that the connected parts of Farey complex structure in plane are triangles or quadrangles. To do this work we go back to plane convex polygones with oriented edge for wich we prove that if two consecutive…

In the article the necessary and sufficient conditions for a representation of Lipschitz function of more than two variables as a difference of two convex functions are formulated. An algorithm of this representation is given. The outcome…

We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…

Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a…

Rigid graphs have only finitely many realizations. In the recent years significant progress was made in computing the number of such realizations. With this progress it was also possible for the first time to do computations on large sets…