Related papers: Circular Separability of Polygons

A separating algebra is, roughly speaking, a subalgebra of the ring of invariants whose elements distinguish between any two orbits that can be distinguished using invariants. In this paper, we introduce a geometric notion of separating…

We provide a constructive algorithm to find the best separable approximation to an arbitrary density matrix of a composite quantum system of finite dimensions. The method leads to a condition of separability and to a measure of…

Visibility graph of a simple polygon is a graph with the same vertex set in which there is an edge between a pair of vertices if and only if the segment through them lies completely inside the polygon. Each pair of adjacent vertices on the…

$\renewcommand{\Re}{\mathbb{R}}$Given a set $P$ of $n$ points in $\Re^d$, consider the problem of computing $k$ subsets of $P$ that form clusters that are well-separated from each other, and each of them is large (cardinality wise). We…

We address the separability problem for straight-line string constraints. The separability problem for languages of a class C by a class S asks: given two languages A and B in C, does there exist a language I in S separating A and B (i.e.,…

The problem of packing a set of circles into the smallest surrounding container is considered. This problem arises in different application areas such as automobile, textile, food, and chemical industries. The so-called circle packing…

We investigate the problem of partitioning a rectilinear polygon $P$ with $n$ vertices and no holes % with no holes into rectangles using disjoint line segments drawn inside $P$ under two optimality criteria. In the minimum ink partition,…

We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…

Given a convex polygon $P$ with $n$ vertices, the two-center problem is to find two congruent closed disks of minimum radius such that they completely cover $P$. We propose an algorithm for this problem in the streaming setup, where the…

Using discrete element methods, we study numerically the dynamics of the size segregation process of binary particle mixtures in three-dimensional rotating drums, operated in the continuous flow regime. Particle rotations are included and…

We present an algorithm for computing a separating linear form of a system of bivariate polynomials with integer coefficients, that is a linear combination of the variables that takes different values when evaluated at distinct (complex)…

We show that, in finite dimensions, around any $m$-partite product state $\rho_{\rm prod}=\rho_1\otimes...\otimes\rho_m$, there exists an ellipsoid of separable states centered around $\rho_{\rm prod}$. This separable ellipsoid contains the…

Let B_1,B_2 be balls in finite-dimensional real vector spaces E_1,E_2, centered around unit length vectors v_1,v_2 and not containing zero. An element in the tensor product space E_1 \otimes E_2 is called B_1 \otimes B_2-separable if it is…

Motivated by indoor localization by tripwire lasers, we study the problem of cutting a polygon into small-size pieces, using the chords of the polygon. Several versions are considered, depending on the definition of the "size" of a piece.…

We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…

In this work we study inside-out dissections of polygons and polyhedra. We first show that an arbitrary polygon can be inside-out dissected with $2n+1$ pieces, thereby improving the best previous upper bound of $4(n-2)$ pieces.…

A system of two particles with spin s=0 and s=1/2 respectively, moving in a plane is considered. It is shown that such a system with a nontrivial spin-orbit interaction can allow an 8 dimensional Lie algebra of first-order integrals of…

Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two…

Let P be a set of n points in R^3. The 2-center problem for P is to find two congruent balls of minimum radius whose union covers P. We present two randomized algorithms for computing a 2-center of P. The first algorithm runs in O(n^3 log^5…

We study new types of geometric query problems defined as follows: given a geometric set $P$, preprocess it such that given a query point $q$, the location of the largest circle that does not contain any member of $P$, but contains $q$ can…