Related papers: Geometric Separability using Orthogonal Objects
A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying between two horizontal cross-sections spaced one unit apart. We…
This work is about the use of regularized optimal-transport distances for convex, histogram-based image segmentation. In the considered framework, fixed exemplar histograms define a prior on the statistical features of the two regions in…
Given an algebra $F[H]^G$ of polynomial invariants of an action of the group $G$ over the vector space $H$, a subset $S$ of $F[H]^G$ is called separating if $S$ separates all orbits that can be separated by $F[H]^G$. A minimal separating…
Orthogonal sets of idempotents are used to design sets of unitary matrices, known as constellations, such that the modulus of the determinant of the difference of any two distinct elements is greater than $0$. It is shown that unitary…
We give an efficient algorithm that, given a graph $G$ and a partition $V_1,\ldots,V_m$ of its vertex set, finds either an independent transversal (an independent set $\{v_1,\ldots,v_m\}$ in $G$ such that $v_i\in V_i$ for each $i$), or a…
Recutting is an operation on planar polygons defined by cutting a polygon along a diagonal to remove a triangle, and then reattaching the triangle along the same diagonal but with opposite orientation. Recuttings along different diagonals…
Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…
Monocular 3D object detection is of great significance for autonomous driving but remains challenging. The core challenge is to predict the distance of objects in the absence of explicit depth information. Unlike regressing the distance as…
A unified method for extracting geometric shape features from binary image data using a steady state partial differential equation (PDE) system as a boundary value problem is presented in this paper. The PDE and functions are formulated to…
We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…
We consider the problem of separability: decide whether a Hermitian operator on a finite dimensional Hilbert tensor product is separable or entangled. We show that the tensor convolution defined for certain mappings on an almost arbitrary…
We propose a conservative algorithm to test the geometrical validity of simplicial (triangles, tetrahedra), tensor product (quadrilaterals, hexahedra), and mixed (prisms) elements of arbitrary polynomial order as they deform over a…
A closed convex subset of a normed linear space is said to have the strong separation property if it can be strongly separated from every other disjoint closed and convex set by a closed hyperplane. In this paper we give some results on the…
The problem of finding a path between two points while avoiding obstacles is critical in robotic path planning. We focus on the feasibility problem: determining whether such a path exists. We model the robot as a query-specific rectangular…
A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two…
Conventionally while we talk about geometry associated with a simple harmonic oscillator, we draw a circle with a radius equal to the amplitude of Oscillator and imagine a particle moving along the perimeter with a frequency same as that of…
Partitioning and grouping of similar objects plays a fundamental role in image segmentation and in clustering problems. In such problems a typical goal is to group together similar objects, or pixels in the case of image processing. At the…
The field of numerical algebraic geometry consists of algorithms for numerically solving systems of polynomial equations. When the system is exact, such as having rational coefficients, the solution set is well-defined. However, for a…
We propose a new geometric method of IR factorization in sector decomposition. The problem is converted into a set of problems in convex geometry. The latter problems are solved using algorithms in combinatorial geometry. This method…
Rectangular designs are classified as regular, Latin regular, semiregular, Latin semiregular and singular designs. Some series of selfdual as well as alpharesolvable designs are obtained using matrix approaches which belong to the above…