Related papers: Geometric Separability using Orthogonal Objects
We provide a simple algorithm for computing a balanced separator for a set of segments that is $c$-packed, showing that the separator cuts only $O(c)$ segments. While the result was known before, arguably our proof is simpler.
We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points $P$ and a finite set of objects $S$ are given in $\mathbb{R}^d$. The objective is to choose a subset…
We develop a class of new kinetic data structures for collision detection between moving convex polytopes; the performance of these structures is sensitive to the separation of the polytopes during their motion. For two convex polygons in…
Three types of geometric structure---grid triangulations, rectangular subdivisions, and orthogonal polyhedra---can each be described combinatorially by a regular labeling: an assignment of colors and orientations to the edges of an…
Graph separation is a central tool in parameterized algorithm design, and important separators are among its most successful ingredients. They yield small, structured families of separators that can be enumerated efficiently, and underlie…
An orthogonal coloring of the two-dimensional unit sphere $\mathbb{S}^2$, is a partition of $\mathbb{S}^2$ into parts such that no part contains a pair of orthogonal points, that is, a pair of points at spherical distance $\pi/2$ apart. It…
We consider integrable systems that are connected with orthogonal separation of variables in complex Riemannian spaces of constant curvature. An isomorphism with the hyperbolic Gaudin magnet, previously pointed out by one of us, extends to…
We prove the existence of optimal separators for intersection graphs of balls and spheres in any dimension $d$. One of our results is that if an intersection graph of $n$ spheres in $\mathbb{R}^d$ has $m$ edges, then it contains a balanced…
Collision detection plays an important role in simulation, control, and learning for robotic systems. However, no existing method is differentiable with respect to the configurations of the objects, greatly limiting the sort of algorithms…
We present an optical element for the separation of superimposed beams which only differ in angle. The beams are angularly resolved and separated by total internal reflection at an air gap between two prisms. As a showcase application, we…
A subset X of a vector space V is said to have the "Separation Property" if it separates linear forms in the following sense: given a pair (a, b) of linearly independent forms on V there is a point x on X such that a(x)=0 and b(x) is not…
Acceleration of algorithms is becoming a crucial problem, if larger data sets are to be processed. Evaluation of algorithms is mostly done by using computational geometry approach and evaluation of computational complexity. However in…
Geometric rounding of a mesh is the task of approximating its vertex coordinates by floating point numbers while preserving mesh structure. Geometric rounding allows algorithms of computational geometry to interface with numerical…
A geometrical picture of separability of 2 x 2 composite quantum systems, showing the region of separable density matrices in the space of hermitian matrices, is given. It rests on the criterion of separability given by Peres, and it is an…
Interference detection of arbitrary geometric objects is not a trivial task due to the heavy computational load imposed by implementation issues. The hierarchically structured bounding boxes help us to quickly isolate the contour of…
Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure…
The input to the distant representatives problem is a set of $n$ objects in the plane and the goal is to find a representative point from each object while maximizing the distance between the closest pair of points. When the objects are…
Given a set of N points, we have discovered an algorithm that can separate these points from one another by n-dimensional planes. Each point is chosen at random and put into a set S and planes which separate them are determined and put into…
First-order automatic differentiation is a ubiquitous tool across statistics, machine learning, and computer science. Higher-order implementations of automatic differentiation, however, have yet to realize the same utility. In this paper I…
Given a real number $t>1$, a geometric $t$-spanner is a geometric graph for a point set in $\mathbb{R}^d$ with straight lines between vertices such that the ratio of the shortest-path distance between every pair of vertices in the graph…