Related papers: Distance in the curve graph

We study the minimum number of distinct distances between point sets on two curves in $R^3$. Assume that one curve contains $m$ points and the other $n$ points. Our main results: (a) When the curves are conic sections, we characterize all…

We study the Teichm\"uller metric on the Teichm\"uller space of a surface of finite type, in regions where the injectivity radius of the surface is small. The main result is that in such regions the Teichm\"uller metric is approximated up…

Let K be a field of characteristic different from 2 and C an elliptic curve over K given by a Weierstrass equation. To divide an element of the group C by 2, one must solve a certain quartic equation. We characterise the quartics arising…

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…

Any quasi-isometry of the complex of curves is bounded distance from a simplicial automorphism. As a consequence, the quasi-isometry type of the curve complex determines the homeomorphism type of the surface.

We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…

This paper is a companion paper to [Lipman and Daubechies 2011]. We provide numerical procedures and algorithms for computing the alignment of and distance between two disk type surfaces. We provide a convergence analysis of the discrete…

We study the problem of calculating noncommutative distances on graphs, using techniques from linear algebra, specifically, Birkhoff-James orthogonality. A complete characterization of the solutions is obtained in the case when the…

We study the problem of computing the diameter and the mean distance of a continuous graph, i.e., a connected graph where all points along the edges, instead of only the vertices, must be taken into account. It is known that for continuous…

Let $P$ be a set of $n$ points in the real plane contained in an algebraic curve $C$ of degree $d$. We prove that the number of distinct distances determined by $P$ is at least $c_d n^{4/3}$, unless $C$ contains a line or a circle. We also…

Let $S_g$ denote a closed, orientable surface of genus $g \geq 2$ and $\mathcal{C}(S_g)$ be the associated curve complex. The mapping class group of $S_g$, $Mod(S_g)$ acts on $\mathcal{C}(S_g)$ by isometries. Since Dehn twists about certain…

We propose an optimization algorithm for computing geodesics on the universal Teichm\"uller space T(1) in the Weil-Petersson ($W P$) metric. Another realization for T(1) is the space of planar shapes, modulo translation and scale, and thus…

In a previous work of the authors, a result to algorithmically compute the topology types of the level curves of an algebraic surface, is given. From this result, here we derive applications based on level curves to determine some…

In this paper we propose formulas for the distance between vertices of a generalized Sierpi\'{n}ski graph $S(G,t)$ in terms of the distance between vertices of the base graph $G$. In particular, we deduce a recursive formula for the…

We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite…

The Straightness is a measure designed to characterize a pair of vertices in a spatial graph. It is defined as the ratio of the Euclidean distance to the graph distance between these vertices. It is often used as an average, for instance to…

Of concern is the study of the space of curves in homogeneous spaces. Motivated by applications in shape analysis we identify two curves if they only differ by their parametrization and/or a rigid motion. For curves in Euclidean space the…

We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all $k \geq 3$, the $k$-CS-transitive such graphs.

We survey theoretical, algorithmic, and computational results at the intersection of distance geometry problems and mathematical programming, both with and without adjacencies as part of the input. While mathematical programming methods can…

In this paper, we present a characterization for the Hausdorff distance between two given algebraic curves in the $n$-dimensional space (parametrically or implicitly defined) to be finite. The characterization is related with the asymptotic…