Related papers: Plane $R$-paths and their rectifiability property

The aim of this paper is to associate a measure for certain sets of paths in the Euclidean plane $\mathbb{R}^2$ with fixed starting and ending points. Then, working on parameterized surfaces with a specific Riemannian metric, we define and…

We classify which local problems with inputs on oriented paths have so-called Borel solution and show that this class of problems remains the same if we instead require a measurable solution, a factor of iid solution, or a solution with the…

We provide an algorithm of constructing a rectifiable curve between two sufficiently close points of a proximally smooth set in a uniformly convex and uniformly smooth Banach space. Our algorithm returns a reasonably short curve between two…

We consider the problem of routing on a network in the presence of line segment constraints (i.e., obstacles that edges in our network are not allowed to cross). Let $P$ be a set of $n$ points in the plane and let $S$ be a set of…

Let $S$ be a complete flat surface, such as the Euclidean plane. We determine the homeomorphism class of the space of all curves on $S$ which start and end at given points in given directions and whose curvatures are constrained to lie in a…

Finite projective planes are constructed using groups that satisfy simple-looking conditions. The resulting projective planes include many known planes and possibly new ones, and are precisely those having a collineation group fixing a flag…

By considering mirror symmetry applied to conformal field theories corresponding to strings propagating in quintic hypersurfaces in projective 4-space, Candelas, de la Ossa, Green and Parkes calculated the ``number of rational curves on the…

This paper addresses the problem of finding shortest paths homotopic to a given disjoint set of paths that wind amongst point obstacles in the plane. We present a faster algorithm than previously known.

Let r be a real number, 0<r<1, given as a dual number. With the sequence of "0", "1" we define a path in a hexagonal lattice. Relations between the properties of r and its path are considered. Generalisations to other bases and lattices.

In this paper, we consider the rectilinear one-center problem on uncertain points in the plane. In this problem, we are given a set $P$ of $n$ (weighted) uncertain points in the plane and each uncertain point has $m$ possible locations each…

We consider packings of the plane using discs of radius 1 and r. A packing is compact if every disc D is tangent to a sequence of discs D_1, D_2, ..., D_n such that D_i is tangent to D_{i+1}. We prove that there are only nine values of r…

Using the Semple bundle construction, we derive an intersection-theoretic formula for the number of simultaneous contacts of specified orders between members of a generic family of degree $d$ plane curves and finitely many fixed curves. The…

In this paper, we introduce a new class of curves \alpha called a f-rectifying curves, which its f-position vector defined by {\alpha}_{f}(s)=\int f(s)T(s)ds always lie in the rectifying plane of \alpha, where f is an integrable function…

Motivated by homothetic solutions to curvature-driven flows of planar curves, as well as their many physical applications, this work carries out a systematic study of oriented curves whose curvature $\kappa$ is a given function of position…

We study tangent sets of strictly self-affine sets in the plane. If a set in this class satisfies the strong separation condition and projects to a line segment for sufficiently many directions, then for each generic point there exists a…

We show that a general plane curve of degree at least 4 is uniquely determined by the full set of its bitangent lines. This problem has an elementary solution for degree at least 5, and the paper is almost entirely devoted to curves of…

The `linear orbit' of a plane curve of degree d is its orbit in the projective space of dimension d(d+3)/2 parametrizing such curves under the natural action of PGL(3). In this paper we compute the degree of the closure of the linear orbits…

This paper addresses the path following control problem for scale-model fixed-wing aircraft. Kinematic guidance and dynamic control laws are developed within a single coherent framework that exploits a simple generic model of aerodynamics…

Fulton asked how many solutions to a problem of enumerative geometry can be real, when that problem is one of counting geometric figures of some kind having specified position with respect to some general fixed figures. For the problem of…

We consider problems in which a simple path of fixed length, in an undirected graph, is to be shifted from a start position to a goal position by moves that add an edge to either end of the path and remove an edge from the other end. We…