Related papers: Simple Curve Embedding

A map $f: K \to \mathbb{R}^d$ of a simplicial complex is an almost embedding if $f(\sigma) \cap f(\tau) = \varnothing$ whenever $\sigma, \tau$ are disjoint simplices of $K$. Fix integers $d,k \geqslant 2$ such that $k+2 \leqslant d…

It is unlikely that the discrete Fr\'echet distance between two curves of length $n$ can be computed in strictly subquadratic time. We thus consider the setting where one of the curves, $P$, is known in advance. In particular, we wish to…

Approximate near-neighbors search (\textsc{ANNS}) is a long-studied problem in computational geometry. %that has received considerable attention by researchers in the community. In this paper, we revisit the problem and propose the first…

We introduce an arbitrary order, computationally efficient method to smooth corners on curves in the plane, as well as edges and vertices on surfaces in $\mathbb R^3$. The method is local, only modifying the original surface in a…

Let $P : \Sigma \rightarrow S$ be a finite degree covering map between surfaces. Rafi and Schleimer show that there is an induced quasi-isometric embedding $\Pi : \mathcal{C}(S) \rightarrow \mathcal{C}(\Sigma)$ between the associated curve…

We study the $c$-approximate near neighbor problem under the continuous Fr\'echet distance: Given a set of $n$ polygonal curves with $m$ vertices, a radius $\delta > 0$, and a parameter $k \leq m$, we want to preprocess the curves into a…

We define and investigate the Fr\'{e}chet edit distance problem. Given two polygonal curves $\pi$ and $\sigma$ and a threshhold value $\delta>0$, we seek the minimum number of edits to $\sigma$ such that the Fr\'{e}chet distance between the…

Low-dimensional representations, or embeddings, of a graph's nodes facilitate several practical data science and data engineering tasks. As such embeddings rely, explicitly or implicitly, on a similarity measure among nodes, they require…

We construct simple curves from immersed curves in the setting of handlebodies and Heegaard splittings. We define a measure of complexity we call girth for closed curves in a handlebody. We extend this complexity to Heegaard splittings and…

Let $M$ be a complete, connected Riemannian surface and suppose that $\mathcal{S} \subset M$ is a discrete subset. What can we learn about $M$ from the knowledge of all distances in the surface between pairs of points of $\mathcal{S}$? We…

We consider the embeddability problem of a graph G into a two-dimensional simplicial complex C: Given G and C, decide whether G admits a topological embedding into C. The problem is NP-hard, even in the restricted case where C is…

A graph $G$ is embeddable in $\mathbb{R}^d$ if vertices of $G$ can be assigned with points of $\mathbb{R}^d$ in such a way that all pairs of adjacent vertices are at the distance 1. We show that verifying embeddability of a given graph in…

We consider the problem of deciding whether an input graph G admits a topological embedding into a two-dimensional simplicial complex C. This problem includes, among others, the embeddability problem of a graph on a surface and the…

We study the problem of computing the Fr\'echet distance between two polygonal curves under transformations. First, we consider translations in the Euclidean plane. Given two curves $\pi$ and $\sigma$ of total complexity $n$ and a threshold…

Graph embedding, especially as a subgraph of a grid, is an old topic in VLSI design and graph drawing. In this paper, we investigate related questions concerning the complexity of embedding a graph $G$ in a host graph that is the strong…

The goal in the min-\# curve simplification problem is to reduce the number of the vertices of a polygonal curve without changing its shape significantly. We study curve-restricted min-\# simplification of polygonal curves, in which the…

We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used between any two successive levels of resolution satisfies some…

Simplifying polygonal curves at different levels of detail is an important problem with many applications. Existing geometric optimization algorithms are only capable of minimizing the complexity of a simplified curve for a single level of…

To produce cartographic maps, simplification is typically used to reduce complexity of the map to a legible level. With schematic maps, however, this simplification is pushed far beyond the legibility threshold and is instead constrained by…

We consider closed, embedded, smooth curves in the plane and study their behaviour under curve flows with a global forcing term. We prove an analogue to Huisken's distance comparison principle for curve shortening flow for initial curves…