相关论文: A square root velocity framework for curves of bou…

This paper deals with a complete invariant $R_X$ for cyclic quotient surface singularities. This invariant appears in the Riemann Roch and Numerical Adjunction Formulas for normal surface singularities. Our goal is to give an explicit…

The computation of the elastic registration of two simple curves in higher dimensions and therefore of the elastic shape distance between them has been investigated by Srivastava et al. Assuming the first curve has one or more starting…

In spite of considerable progress, computing curvature in Volume of Fluid (VOF) methods continues to be a challenge. The goal is to develop a function or a subroutine that returns the curvature in computational cells containing an interface…

In [Computer Aided Geometric Design 27 (2010), 212-231] the authors present an algorithm to parametrize approximately $\epsilon$-rational curves, and they show in 2 examples that the Hausdorff distance, w.r.t. to the Euclidean distance,…

We augment a tree $T$ with a shortcut $pq$ to minimize the largest distance between any two points along the resulting augmented tree $T+pq$. We study this problem in a continuous and geometric setting where $T$ is a geometric tree in the…

We consider the curves whose all normal planes are at the same distance from a fixed point and obtain some characterizations of them in the 3-dimensional Euclidean space.

Quasi-isometries are mappings on graphs, with distance-distortions parameterized by a multiplicative factor and an additive constant. The distance-distortions of quasi-isometries are in a general form that captures a wide range of…

We introduce a novel representation and optimization framework for discrete geodesics on triangle meshes that reduces artifacts of linear methods on uneven and coarse discretizations. Our method computes squared geodesic distances from…

The computation of the elastic shape registration of two simple surfaces in 3-dimensional space and therefore of the elastic shape distance between them has been investigated by Kurtek, Jermyn, et al. who have proposed algorithms to carry…

Motivated by a M\"obius invariant subdivision scheme for polygons, we study a curvature notion for discrete curves where the cross-ratio plays an important role in all our key definitions. Using a particular M\"obius invariant…

We introduce an orientation-preserving landmark-based distance for continuous curves, which can be viewed as an alternative to the \Frechet or Dynamic Time Warping distances. This measure retains many of the properties of those measures,…

Rotation distance between trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance. In the case of ordered rooted trees, we…

In this paper, we propose a novel lower dimensional representation of a shape sequence. The proposed dimension reduction is invertible and computationally more efficient in comparison to other related works. Theoretically, the differential…

For a rational parameterization of a curve, it is desirable that its angular speed is as uniform as possible. Hence, given a rational parameterization, one wants to find re-parameterization with better uniformity. One natural way is to use…

We consider the problem of computing the Fr\'echet distance between two curves for which the exact locations of the vertices are unknown. Each vertex may be placed in a given uncertainty region for that vertex, and the objective is to place…

This paper studies a specific metric on plane curves that has the property of being isometric to classical manifold (sphere, complex projective, Stiefel, Grassmann) modulo change of parametrization, each of these classical manifolds being…

We define a distance analogous to the Gromov-Hausdorff distance that enables the comparison of arbitrary quasi-isometric spaces. We also investigate properties preserved under limits with respect to this distance, as well as properties of…

This paper aims at building a unified framework to deal with a wide class of local and nonlocal translation-invariant geometric flows. First, we introduce a class of generalized curvatures, and prove the existence and uniqueness for the…

In the elastic shape analysis approach to shape matching and object classification, plane curves are represented as points in an infinite-dimensional Riemannian manifold, wherein shape dissimilarity is measured by geodesic distance. A…

Traditional problems in computational geometry involve aspects that are both discrete and continuous. One such example is nearest-neighbor searching, where the input is discrete, but the result depends on distances, which vary continuously.…