Related papers: Projections in the curve complex arising from cove…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
Let ${\mathcal C}(\Omega)$ be the linear code arising from a projective system $\Omega$ of $\mathrm{PG}(V).$ Consider the point-line geometry $\Gamma=({\mathcal P},{\mathcal L})$ and a projective embedding $\varepsilon\colon…
We propose shifted inner-product similarity (SIPS), which is a novel yet very simple extension of the ordinary inner-product similarity (IPS) for neural-network based graph embedding (GE). In contrast to IPS, that is limited to…
We prove an effective version of a theorem relating curve complex distance to electric distance in hyperbolic 3-manifolds, up to errors that are polynomial in the complexity of the underlying surface. We use this to give an effective proof…
We study the {\it arc and curve} complex $AC(S)$ of an oriented connected surface $S$ of finite type with punctures. We show that if the surface is not a sphere with one, two or three punctures nor a torus with one puncture, then the…
In approximation theory classical discrete operators, like generalized sampling, Sz\'{a}sz-Mirak'jan, Baskakov and Bernstein operators, have been extensively studied for scalar functions. In this paper, we look at the approximation of…
We study shortest curves in proximally smooth subsets of a Hilbert space. We consider an $R$-proximally smooth set $A$ in a Hilbert space with points $a$ and $b$ satisfying $\left|{a-b}\right| < 2R.$ We provide a simple geometric algorithm…
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…
Let $\Sigma$ be a smooth projective surface, let $f' : S' \to \Sigma$ be a double cover of $\Sigma$ and let $\mu : S \to S'$ be the canonical resolution. Put $f = f'\circ\mu$. An irreducible curve $C$ on $\Sigma$ is said to be a splitting…
The Fr\'echet distance is a popular distance measure for curves which naturally lends itself to fundamental computational tasks, such as clustering, nearest-neighbor searching, and spherical range searching in the corresponding metric…
The preservation of ambient isotopic equivalence under piecewise linear (PL) approximation for smooth knots are prominent in molecular modeling and simulation. Sufficient conditions are given regarding: (1) Hausdorff distance, and (2) a sum…
Many geometry processing techniques require the solution of partial differential equations (PDEs) on manifolds embedded in $\mathbb{R}^2$ or $\mathbb{R}^3$, such as curves or surfaces. Such manifold PDEs often involve boundary conditions…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[m]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [m]$ of $[m]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…
We describe a general approach for constructing a broad class of operators approximating high-dimensional curves based on geometric Hermite data. The geometric Hermite data consists of point samples and their associated tangent vectors of…
In the presence of certain topological conditions, we provide lower bounds for the infimum of the length function associated to a collection of curves on Teichm\"uller space that depend on the dual cube complex associated to the collection,…
We construct a family of canonical connections and surrounding basic theory for almost complex manifolds that are equipped with an affine connection. This framework provides a uniform approach to treating a range of geometries. In…
This paper studies the problem of computing quasi-upward planar drawings of bimodal plane digraphs with minimum curve complexity, i.e., drawings such that the maximum number of bends per edge is minimized. We prove that every bimodal plane…
Any finite configuration of curves with minimal intersections on a surface is a configuration of shortest geodesics for some Riemannian metric on the surface. The metric can be chosen to make the lengths of these geodesics equal to the…
Let $\varphi:F_1\to F_2$ be an injective morphism of free groups. If $\varphi$ is geometric (i.e. induced by an inclusion of oriented compact connected surfaces with nonempty boundary), then we show that $\varphi$ is an isometric embedding…