Related papers: Comparing Curves in Homogeneous Spaces
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…
In the shape analysis approach to computer vision problems, one treats shapes as points in an infinite-dimensional Riemannian manifold, thereby facilitating algorithms for statistical calculations such as geodesic distance between shapes…
We give an alternative approach to the computation of the dimension of the tangent space of the deformation space of curves with automorphisms. A homological version of the local-global principle similar to the one of J.Bertin, A. M\'ezard…
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.…
Generalist neural routing solvers have shown great potential in solving diverse vehicle routing problems (VRPs) with a unified model. However, existing solvers are typically limited to symmetric settings or degrade in performance when…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
The Fr\'echet distance is a popular similarity measure that is well-understood for polygonal curves in $\mathbb{R}^d$: near-quadratic time algorithms exist, and conditional lower bounds suggest that these results cannot be improved…
Spatial curvature is one of the fundamental cosmological parameters that is routinely constrained from observations. The forward modelling of observations, in particular of large-scale structure, often relies on large cosmological…
We study variational problems for curves approximated by B-spline curves. We show that, one can obtain discrete Euler-Lagrange equations, for the data describing the approximated curves. Our main application is to the curve completion…
We study properties of Sobolev-type metrics on the space of immersed plane curves. We show that the geodesic equation for Sobolev-type metrics with constant coefficients of order 2 and higher is globally well-posed for smooth initial data…
We study surfaces in Euclidean space constructed by the sum of two curves or that are graphs of the product of two functions. We consider the problem to determine all these surfaces with constant Gauss curvature. We extend the results to…
Hodograph equations for the Euler equation in curved spaces with constant pressure are discussed. It is shown that the use of known results concerning geodesics and associated integrals allows to construct several types of hodograph…
In this paper we study maps (curved flats) into symmetric spaces which are tangent at each point to a flat of the symmetric space. Important examples of such maps arise from isometric immersions of space forms into space forms via their…
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…
Distance measuring is a very important task in digital geometry and digital image processing. Due to our natural approach to geometry we think of the set of points that are equally far from a given point as a Euclidean circle. Using the…
The main purpose is to describe the evolution of $\Xt = \Xs \wedge_- \Xss,$ with $\X(s,0)$ a regular polygonal curve with a nonzero torsion in the 3-dimensional hyperbolic space. Unlike in the Euclidean space, a nonzero torsion implies two…
Two curves are affinely equivalent if there exists an affine mapping transforming one of them onto the other. Thus, detecting affine equivalence comprises, as important particular cases, similarity, congruence and symmetry detection. In…
A fundamental problem in computational geometry is to compute an obstacle-avoiding Euclidean shortest path between two points in the plane. The case of this problem on polygonal obstacles is well studied. In this paper, we consider the…
In the last two decades, much effort has been dedicated to studying curves and surfaces according to their angle with a given direction. However, most findings were obtained using a case-by-case approach, and it is often unclear what are…
We use the intrinsic area to define a distance on the space of homothety classes of convex bodies in the $n$-dimensional Euclidean space, which makes it isometric to a convex subset of the infinite dimensional hyperbolic space. The ambient…