Related papers: Semi-dynamic connectivity in the plane

Let $S$ be a planar point set in general position, and let $\mathcal{P}(S)$ be the set of all plane straight-line paths with vertex set $S$. A flip on a path $P \in \mathcal{P}(S)$ is the operation of replacing an edge $e$ of $P$ with…

We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…

In this article, we consider $\mathcal{I}^\mathcal{K}$-convergence to define a new concept of convergence namely, $\mathcal{S}$-$\mathcal{I}^\mathcal{K}$-convergence which generalizes the notion of $\mathcal{S}$-$\mathcal{I}$-convergence…

We investigate the problem of strong connectivity augmentation within plane oriented graphs. We show that deciding whether a plane oriented graph $D$ can be augmented with (any number of) arcs $X$ such that $D+X$ is strongly connected, but…

This article is concerned with analytic Hamiltonian dynamical systems in infinite dimension in a neighborhood of an elliptic fixed point. Given a quadratic Hamiltonian, we consider the set of its analytic higher order perturbations. We…

The motion of planar ground vehicles is often non-holonomic, and as a result may be modelled by the 2 DoF Ackermann steering model. We analyse the feasibility of estimating such motion with a downward facing camera that exerts…

We introduce two generalizations of synchronizability to automata with transitions weighted in an arbitrary semiring K=(K,+,*,0,1). (or equivalently, to finite sets of matrices in K^nxn.) Let us call a matrix A location-synchronizing if…

While compactness is an essential assumption for many results in dynamical systems theory, for many applications the state space is only locally compact. Here we provide a general theory for compactifying such systems, i.e. embedding them…

We study the S-integral points on the complement of a union of hyperplanes in projective space, where S is a finite set of places of a number field k. In the classical case where S consists of the set of archimedean places of k, we…

Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…

We present a new automated method for finding integrable symplectic maps of the plane. These dynamical systems possess a hidden symmetry associated with an existence of conserved quantities, i.e. integrals of motion. The core idea of the…

It is shown that one can count $k$-edge paths in an $n$-vertex graph and $m$-set $k$-packings on an $n$-element universe, respectively, in time ${n \choose k/2}$ and ${n \choose mk/2}$, up to a factor polynomial in $n$, $k$, and $m$; in…

Chv\'{a}tal and Klincsek (1980) gave an $O(n^3)$-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set $P$ of $n$ points in the plane. This paper examines a generalization of the problem,…

In a separably connected space any two points are contained in a separable connected subset. We show a mechanism that takes a connected bounded metric space and produces a complete connected metric space whose separablewise components form…

In many cases the convexity of the image of a linear map with range is $R^n$ is automatic because of the facial structure of the domain of the map. We develop a four step procedure for proving this kind of ``automatic convexity''. To make…

An inverse problem of elasticity of $n$ elastic inclusions embedded into an elastic half-plane is analyzed. The boundary of the half-plane is free of traction. The half-plane and the inclusions are subjected to antiplane shear, and the…

Given $2n$ points in the plane, it is well-known that there always exists a perfect straight-line non-crossing matching. We show that it is $NP$-complete to decide if a partial matching can be augmented to a perfect one, via a reduction…

We show that for any finite set $P$ of points in the plane and $\epsilon>0$ there exist $\displaystyle O\left(\frac{1}{\epsilon^{3/2+\gamma}}\right)$ points in ${\mathbb{R}}^2$, for arbitrary small $\gamma>0$, that pierce every convex set…

Given a semi-Hamiltonian system, we construct an $F$-manifold with a connection satisfying a suitable compatibility condition with the product. We exemplify this procedure in the case of the so-called $\epsilon$-system. The corresponding…

Finding two disjoint simple paths on two given sets of points is a geometric problem introduced by Jeff Erickson. This problem has various applications in computational geometry, like robot motion planning, generating polygon etc. We will…