Related papers: Shortest curves in proximally smooth sets: existen…
We consider the problem of minimizing Euler's elastica energy for simple closed curves confined to the unit disk. We approximate a simple closed curve by the zero level set of a function with values +1 on the inside and -1 on the outside of…
Given a set $\mathcal{P}$ of $h$ pairwise disjoint simple polygonal obstacles in $\mathbb{R}^2$ defined with $n$ vertices, we compute a sketch $\Omega$ of $\mathcal{P}$ whose size is independent of $n$, depending only on $h$ and the input…
We give an accessible introduction and elaboration on the methods used in obtaining a geodesic, which is the curve of shortest length connecting two points lying on the surface of a function. This is found through computing what's known as…
We study the local regularity of sliding almost minimal sets of dimension 2 in $R^n$ , bounded by a smooth curve $L$. These are a good way to model soap films bounded by a curve, and their definition is similar to Almgren's. We aim for a…
In this paper we study the geometry of metric spheres in the curve complex of a surface, with the goal of determining the "average" distance between points on a given sphere. Averaging is not technically possible because metric spheres in…
The proper Euclidean geometry is considered to be metric space and described in terms of only metric and finite metric subspaces (sigma-immanent description). Constructing the geometry, one does not use topology and topological properties.…
We consider the minimal action problem min \int\_R 1/2 |$\gamma$'|^2 + W($\gamma$) dt among curves lying in a non-locally-compact metric space and connecting two given zeros of W $\ge$ 0. For this problem, the optimal curves are usually…
The reductivity of a spherical curve is the minimal number of a local transformation called an inverse-half-twisted splice required to obtain a reducible spherical curve from the spherical curve. It is unknown if there exists a spherical…
Laurent Hauswirth and Harold Rosenberg developed the theory of minimal surfaces with finite total curvature in $\H^2\times\R$. They showed that the total curvature of one such a surface must be a non-negative integer multiple of $-2\pi$.…
We show that there exists a metric with positive scalar curvature on S2xS1 and a sequence of embedded minimal cylinders that converges to a minimal lamination that, in a neighborhood of a strictly stable 2-sphere, is smooth except at two…
It is proved that the number of shortest paths between two vertices of distance $t$ in a graph with degrees bounded by $\Delta$ is at most $2 \cdot (\frac{\Delta}{2})^t$. This improves upon the na\"ive $\Delta (\Delta-1) ^{t-1}$ bound.
Pathfinding in Euclidean space is a common problem faced in robotics and computer games. For long-distance navigation on the surface of the earth or in outer space however, approximating the geometry as Euclidean can be insufficient for…
In this paper, we extend the notion of stationary curves with respect to the moment of inertia from a point $N$ in the Euclidean plane $\mathbb{R}^2$ to the case that the ambient space is either the hyperbolic plane $\mathbb{H}^2$ or the…
We show that we can obtain a reducible spherical curve from any non-trivial spherical curve by four or less inverse-half-twisted splices, i.e., the reductivity, which represents how reduced a spherical curve is, is four or less. We also…
We present a new method for visualizing implicit real algebraic curves inside a bounding box in the $2$-D or $3$-D ambient space based on numerical continuation and critical point methods. The underlying techniques work also for tracing…
The aim of the paper is to investigate the rigidity and the deformability of pseudoholomorphic curves in the nearly K{\"a}hler sphere $\mathbb{S}^6,$ among minimal surfaces in spheres. Under various assumptions we describe the moduli space…
Starting with a similarity function between objects, it is possible to define a distance metric on pairs of objects, and more generally on probability distributions over them. These distance metrics have a deep basis in functional analysis,…
We present a fixed-parameter tractable (FPT) algorithm to find a shortest curve that encloses a set of k required objects in the plane while paying a penalty for enclosing unwanted objects. The input is a set of interior-disjoint simple…
We revisit the well-known Curve Shortening Flow for immersed curves in the $d$-dimensional Euclidean space. We exploit a fundamental structure of the problem to derive a new global construction of a solution, that is, a construction that is…
We prove that if $(M,g)$ is a topological 3-ball with a $C^4$-smooth Riemannian metric $g$, and mean-convex boundary $\partial M$ then knowledge of least areas circumscribed by simple closed curves $\gamma \subset \partial M$ uniquely…