Related papers: Projections in the curve complex arising from cove…
We present a nodal interpolation method to approximate a subdivision model. The main application is to model and represent curved geometry without gaps and preserving the required simulation intent. Accordingly, we devise the technique to…
We prove that, given a compact Riemann surface $\Sigma$ and disjoint finite sets $\varnothing\neq E\subset\Sigma$ and $\Lambda\subset\Sigma$, every map $\Lambda \to \mathbb{R}^3$ extends to a complete conformal minimal immersion…
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 presents the first purely numerical (i.e., non-algebraic) subdivision algorithm for the isotopic approximation of a simple arrangement of curves. The arrangement is "simple" in the sense that any three curves have no common…
We prove a symmetric version of B\'ezout's theorem. More precisely, we show that the symmetric orbit type of a transverse intersection of complex symmetric hypersurfaces in projective space is determined by the degrees. In the projective…
A map $\varphi:K\to R^2$ of a graph $K$ is approximable by embeddings, if for each $\varepsilon>0$ there is an $\varepsilon$-close to $\varphi$ embedding $f:K\to R^2$. Analogous notions were studied in computer science under the names of…
We resolve in the affirmative conjectures of Repovs and A. Skopenkov (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our…
By studying $\mathbb{A}^1$-curves on varieties, we propose a geometric approach to strong approximation problem over function fields of complex curves. We prove that strong approximation holds for smooth, low degree affine complete…
An isometric embedding of a graph into a metric space is an embedding of the vertices such that the smallest number of edges connecting any two vertices equals to the distance in the metric space between the images. In this paper, we study…
We present a certified algorithm that takes a smooth algebraic curve in $\mathbb{R}^n$ and computes an isotopic approximation for a generic projection of the curve into $\mathbb{R}^2$. Our algorithm is designed for curves given implicitly…
A graph covering projection, also referred to as a locally bijective homomorphism, is a mapping between the vertices and edges of two graphs that preserves incidences and is a local bijection. This concept originates in topological graph…
In this paper we provide two new constructions that are useful for the theory of projection complexes developed by Bestvina, Bromberg, Fujiwara and Sisto. We prove that there exists a subtree of the projection complex which is…
This paper is concerned with the computation of an optimal matching between two manifold-valued curves. Curves are seen as elements of an infinite-dimensional manifold and compared using a Riemannian metric that is invariant under the…
A quasisymmetric graph is a curve whose projection onto a line is a quasisymmetric map. We show that this class of curves is related to solutions of the reduced Beltrami equation and to a generalization of the Zygmund class $\Lambda_*$.…
The congestion of a curve is a measure of how much it zigzags around locally. More precisely, a curve $\pi$ is $c$-packed if the length of the curve lying inside any ball is at most $c$ times the radius of the ball, and its congestion is…
We prove several interpolation results for holomorphic Legendrian curves lying in an odd dimensional complex Euclidean space with the standard contact structure. In particular, we show that an arbitrary countable set of points in…
We introduce the separating semigroup of a real algebraic curve of dividing type. The elements of this semigroup record the possible degrees of the covering maps obtained by restricting separating morphisms to the real part of the curve. We…
Let S be the boundary of a handlebody M. We prove that the set of curves in S that are boundaries of disks in M, considered as a subset of the complex of curves of S, is quasi-convex.
In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…
In this article, we investigate the rank index of projective curves $\mathscr{C} \subset \mathbb{P}^r$ of degree $r+1$ when $\mathscr{C} = \pi_p (\tilde{\mathscr{C}})$ for the standard rational normal curve $\tilde{\mathscr{C}} \subset…