Related papers: Shortest curves in proximally smooth sets: existen…
We study mapping class group orbits of homotopy and isotopy classes of curves with self-intersections. We exhibit the asymptotics of the number of such orbits of curves with a bounded number of self-intersections, as the complexity of the…
Shortest paths problems are subject to extensive studies in classic distributed models such as the CONGEST or Congested Clique. These models dictate how nodes may communicate in order to determine shortest paths in a distributed input…
We propose a geometric method for quantifying the difference between parametrized curves in Euclidean space by introducing a distance function on the space of parametrized curves up to rigid transformations (rotations and translations).…
Globally non-positively curved, or CAT(0), polyhedral complexes arise in a number of applications, including evolutionary biology and robotics. These spaces have unique shortest paths and are composed of Euclidean polyhedra, yet many…
We study the problem of polygonal curve simplification under uncertainty, where instead of a sequence of exact points, each uncertain point is represented by a region, which contains the (unknown) true location of the vertex. The regions we…
We construct two minimal Cheeger sets in the Euclidean plane, i.e. unique minimizers of the ratio "perimeter over area" among their own measurable subsets. The first one gives a counterexample to the so-called weak regularity property of…
In this paper, we want to study the link between the presence of compact objects with some analytic structure and the global geometry of a weakly complete surface. We begin with a brief survey of some now classic results on the local…
Suppose that $M$ is a $2$-dimensional oriented Riemannian manifold, and let $\gamma$ be a simple closed curve on $M$. Let $m \gamma$ denote the curve formed by tracing $\gamma$ $m$ times. We prove that if $m \gamma$ is contractible through…
In the classical best approximation pair (BAP) problem, one is given two nonempty, closed, convex and disjoint subsets in a finite- or an infinite-dimensional Hilbert space, and the goal is to find a pair of points, each from each subset,…
The present paper generalizes the result from one of the papers by Galstyan. Namely, we consider two nonempty subsets $A$ and $B$ of a metric space $X$, and construct one-parametric family $F_r$ of subsets obtained by intersection between…
A subset of the sphere is said short if it is contained in an open hemisphere. A short closed set which is geodesically convex is called a cap. The following theorem holds: 1. The minimal number of short closed sets covering the $n$-sphere…
In this work we study shortest path problems in multimode graphs, a generalization of the min-distance measure introduced by Abboud, Vassilevska W. and Wang in [SODA'16]. A multimode shortest path is the shortest path using one of multiple…
In this paper we study the curvature flow of a curve in a plane endowed with a minkowskian norm whose unit ball is smooth. We show that many of the properties known in the euclidean case can be extended (with due adaptations) to this new…
We construct examples of $C^\infty$ smooth submanifolds in ${\Bbb C}^n$ and ${\Bbb R}^n$ of codimension 2 and 1, which intersect every complex, respectively real, analytic curve in a discrete set. The examples are realized either as compact…
This paper gives a partial confirmation of a conjecture of P. Agarwal, S. Har-Peled, M. Sharir, and K. Varadarajan that the total curvature of a shortest path on the boundary of a convex polyhedron in the 3-dimensional Euclidean space…
Given two simplicial complexes in R^d, and start and end vertices in each complex, we show how to compute curves (in each complex) between these vertices, such that the Fr\'echet distance between these curves is minimized. As a polygonal…
The complex of curves $\mathcal{C}(S_g)$ of a closed orientable surface of genus $g \geq 2$ is the simplicial complex having its vertices, $\mathcal{C}^0(S_g)$, are isotopy classes of essential curves in $S_g$. Two vertices co-bound an edge…
Many statistical and machine learning approaches rely on pairwise distances between data points. The choice of distance metric has a fundamental impact on performance of these procedures, raising questions about how to appropriately…
This article introduces and studies the tight approximation property, a property of algebraic varieties defined over the function field of a complex or real curve that refines the weak approximation property (and the known cohomological…
We provide an efficient algorithm to compute the minimum area of a homotopy between two closed plane curves, given that they divide the plane into finite number of regions. For any positive real number $\varepsilon>0$, we construct a closed…