Related papers: Semi-dynamic connectivity in the plane
In this paper, we consider a transformation of $k$ disjoint paths in a graph. For a graph and a pair of $k$ disjoint paths $\mathcal{P}$ and $\mathcal{Q}$ connecting the same set of terminal pairs, we aim to determine whether $\mathcal{P}$…
Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…
We present the first fully dynamic connectivity data structures for geometric intersection graphs achieving constant query time and sublinear amortized update time for most types of geometric objects in 2D. Our data structures can answer…
We study the amortized number of combinatorial changes (edge insertions and removals) needed to update the graph structure of the Voronoi diagram $\mathcal{V}(S)$ (and several variants thereof) of a set $S$ of $n$ sites in the plane as…
Let $S$ be a set of $n$ points in general position in the plane. Join every pair of points in $S$ with a straight line segment. Let $\overline{cr}(S)$ be number of pairs of these edges that intersect in their interior. Suppose that this…
Given a compact metric space $X$ and an upper semicontinuous function $F\colon X \to 2^X$, we explore the dynamic system $(X,F)$. In this study, we introduce new concepts, demonstrate various results, and provide numerous examples. In…
Let $\{\phi_s\}_{s\in S}$ be a commutative semigroup of completely positive, contractive, and weak*-continuous linear maps acting on a von Neumann algebra $N$. Assume there exists a semigroup $\{\alpha_s\}_{s\in S}$ of weak*-continuous…
Partial trace is a very important mathematical operation in quantum mechanics. It is not only helpful in studying the subsystems of a composite quantum system but also used in computing a vast majority of quantum entanglement measures.…
We study the link between a compact hypersurface in $\P^{n+1}$ and the set of all its tangent planes. In this context, we identify $\P^{n+1}$ to the set of linear subspaces of codimension one by orthogonal complementarity. This gives rise…
We consider the optical and transport properties in a model two-dimensional Hamiltonian which describes the merging of two Dirac points. At low energy, in the presence of an energy gap parameter $\Delta$, there are two distinct Dirac points…
Given a compact, connected Lie group $K$, we use principal $K$-bundles to construct manifolds with prescribed finite-dimensional algebraic models. Conversely, let $M$ be a compact, connected, smooth manifold which supports an almost free…
We improve upon the running time for finding a point in a convex set given a separation oracle. In particular, given a separation oracle for a convex set $K\subset \mathbb{R}^n$ contained in a box of radius $R$, we show how to either find a…
In this paper, we deal with analytic and geometric properties of orthogonally convex sets. We establish a Blaschke-type theorem for path-connected and orthogonally convex sets in the plane using orthogonally convex paths. The separation of…
New superintegrable systems are presented which, like the Hydrogen atom, possess a dynamical symmetry w.r.t. algebra o(4). One of them simulates a neutral fermion with non-trivial dipole moment, interacting with the external e.m. field.…
We study diagonal arrangement complements $D(K)$ in $\mathbb{C}^m$. We consider the class of simplicial complexes $K$ in which any two missing faces have a common vertex, and prove that the coordinate arrangement complement $U(K)$ is the…
We consider some generalizations of the Asymmetric Traveling Salesman Path problem. Suppose we have an asymmetric metric G = (V,A) with two distinguished nodes s,t. We are also given a positive integer k. The goal is to find k paths of…
We consider preprocessing a set $S$ of $n$ points in convex position in the plane into a data structure supporting queries of the following form: given a point $q$ and a directed line $\ell$ in the plane, report the point of $S$ that is…
Answering connectivity queries in real algebraic sets is a fundamental problem in effective real algebraic geometry that finds many applications in e.g. robotics where motion planning issues are topical. This computational problem is…
The Kreweras complementation map is an anti-isomorphism on the lattice of noncrossing partitions. We consider an analogous operation for plane trees motivated by the molecular biology problem of RNA folding. In this context, we explicitly…
We propose a novel, multi-layered planning approach for computing paths that satisfy both kinodynamic and spatiotemporal constraints. Our three-part framework first establishes potential sequences to meet spatial constraints, using them to…