Related papers: Geometric Separability using Orthogonal Objects
We introduce the problem of partitioning 2D regions (usually convex regions) into mutually congruent pieces ('tiles').
We initiate the study of diameter computation in geometric intersection graphs from the fine-grained complexity perspective. A geometric intersection graph is a graph whose vertices correspond to some shapes in $d$-dimensional Euclidean…
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…
Segregation is a popular phenomenon. It has considerable effects on material performance. To the author's knowledge, there is still no automated objective quantitative indicator for segregation. In order to full fill this task, segregation…
We introduce an algorithm which can be directly used to feasible and optimum search in linear programming. Starting from an initial point the algorithm iteratively moves a point in a direction to resolve the violated constraints. At the…
This paper proposes a minimal contractor and a minimal separator for an area delimited by an hyperbola of the plane. The task is facilitated using actions induced by the hyperoctahedral group of symmetries. An application related to the…
We construct partitions of rectangles into smaller rectangles from an input consisting of a planar dual graph of the layout together with restrictions on the orientations of edges and junctions of the layout. Such an orientation-constrained…
Given a set $P$ of $n$ points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate $n$ points, picked randomly…
The Plancherel decomposition of $L^2$ on a pseudo-Riemannian symmetric space $GL(n,C)/GL(n,R)$ has spectrum of $[n/2]$ types. We write explicitly orthogonal projectors separating spectrum into uniform pieces
A classical result from topology called Uryshon's lemma asserts the existence of a continuous separator of two disjoint closed sets in a sufficiently regular topological space. In this work we make a search for this separator constructive…
The aim of this paper is to investigate an attempt to build a binary classification algorithm using principles of geometry such as vectors, planes, and vector algebra. The basic idea behind the proposed algorithm is that a hyperplane can be…
We find a criterion for an effective divisor $D$ on a smooth surface to be left-orthogonal or strongly left-orthogonal (i.e. for the pair of line bundles $(\mathcal O,\mathcal O(D))$ to be exceptional or strong exceptional).
Casting is a manufacturing process where liquid material is poured into a mold having the shape of a desired product. After the material solidifies, the product is removed from the mold. We study the case where the mold is made of a single…
In two-dimensional geometric knapsack problem, we are given a set of n axis-aligned rectangular items and an axis-aligned square-shaped knapsack. Each item has integral width, integral height and an associated integral profit. The goal is…
Divide and Conquer is a well known algorithmic procedure for solving many kinds of problem. In this procedure, the problem is partitioned into two parts until the problem is trivially solvable. Finding the distance of the closest pair is an…
We review the theory of orthogonal separation of variables on pseudo-Riemannian manifolds of constant non-zero curvature via concircular tensors and warped products. We then apply this theory simultaneously to both the three-dimensional…
Quantum states that remain separable (i.e., not entangled) under any global unitary transformation are known as absolutely separable and form a convex set. Despite extensive efforts, the complete characterization of this set remains largely…
There are few industries which use manually controlled robots for carrying material and this cannot be used all the time in all the places. So, it is very tranquil to have robots which can follow a specific human by following the unique…
Given two sets $R$ and $B$ of $n$ points in the plane, we present efficient algorithms to find a two-line linear classifier that best separates the "red" points in $R$ from the "blue" points in $B$ and is robust to outliers. More precisely,…
According to a result of Arkin~\etal~(2016), given $n$ point pairs in the plane, there exists a simple polygonal cycle that separates the two points in each pair to different sides; moreover, a $O(\sqrt{n})$-factor approximation with…