Related papers: A square root velocity framework for curves of bou…
Converting a parametric curve into the implicit form, which is called implicitization, has always been a popular but challenging problem in geometric modeling and related applications. However, the existing methods mostly suffer from the…
Discretization of curves is an ancient topic. Even discretization of curves with an eye toward differential geometry is over a century old. However there is no general theory or methodology in the literature, despite the ubiquitous use of…
In well-studied graph modification problems, adding and deleting vertices and edges are used as graph editing operations. We propose a model for graph modification on geometric intersection graphs called Geometric Graph Edit Distance that…
There are many physical processes that have inherent discontinuities in their mathematical formulations. This paper is motivated by the specific case of collisions between two rigid or deformable bodies and the intrinsic nature of that…
Computing the Fr\'{e}chet distance for surfaces is a surprisingly hard problem and the only known algorithm is limited to computing it between flat surfaces. We adapt this algorithm to create one for computing the Fr\'{e}chet distance for a…
In scientific visualization, scalar fields are often compared through edit distances between their merge trees. Typical tasks include ensemble analysis, feature tracking and symmetry or periodicity detection. Tree edit distances represent…
The Fr\'echet distance is a commonly used distance measure for curves. Computing the Fr\'echet distance between two polygonal curves of $n$ vertices takes roughly quadratic time, and conditional lower bounds suggest that approximating to…
Bayesian analysis of functions and curves is considered, where warping and other geometrical transformations are often required for meaningful comparisons. We focus on two applications involving the classification of mouse vertebrae shape…
A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fr\'echet distance. Whereas efficient algorithms are known for computing the Fr\'echet distance of polygonal curves, the same problem for…
Given a non-rational real space curve and a tolerance $\epsilon>0$, we present an algorithm to approximately parametrize the curve. The algorithm checks whether a planar projection of the space curve is $\epsilon$-rational and, in the…
In this work, we study plane and spherical curves in Euclidean and Lorentz-Minkowski 3-spaces by employing rotation minimizing (RM) frames. By conveniently writing the curvature and torsion for a curve on a sphere, we show how to find the…
This paper presents a guidance algorithm for solving the problem of following parametric paths, as well as a curvature-varying speed setpoint for land-based car-type wheeled mobile robots (WMRs). The guidance algorithm relies on…
We present a method for constructing all bounded rational motions that frame a space curve $\mathbf{r}(t)$. This means that the motion guides an orthogonal frame along the curve such that one frame axis is in direction of the curve tangent.…
We study the concept of quadratic variation of a continuous path along a sequence of partitions and its dependence with respect to the choice of the partition sequence. We define the concept of quadratic roughness of a path along a…
We consider embedded, smooth curves in the plane which are either closed or asymptotic to two lines. We study their behaviour under curve shortening flow with a global forcing term. Firstly, we prove an analogue to Huisken's distance…
Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…
For a graph $G=(V,E)$, its exact-distance square, $G^{[\sharp 2]}$, is the graph with vertex set $V$ and with an edge between vertices $x$ and $y$ if and only if $x$ and $y$ have distance (exactly) $2$ in $G$. The graph $G$ is an…
Due to its many applications, \emph{curve simplification} is a long-studied problem in computational geometry and adjacent disciplines, such as graphics, geographical information science, etc. Given a polygonal curve $P$ with $n$ vertices,…
I show that every rectifiable simple closed curve in the plane can be continuously deformed into a convex curve in a motion which preserves arc length and does not decrease the Euclidean distance between any pair of points on the curve.…
Three methods of least squares are examined for fitting a line to points in the plane. Two well known methods are to minimize sums of squares of vertical or horizontal distances to the line. Less known is to minimize sums of squares of…