Related papers: Angular Convergence during Bezier Curve Approximat…
Stochastic alternating algorithms for bi-objective optimization are considered when optimizing two conflicting functions for which optimization steps have to be applied separately for each function. Such algorithms consist of applying a…
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…
Any subset of the plane can be approximated by a set of square pixels. This transition from a shape to its pixelation is rather brutal since it destroys geometric and topological information about the shape. Using a technique inspired by…
We study the minimum number of distinct distances between point sets on two curves in $R^3$. Assume that one curve contains $m$ points and the other $n$ points. Our main results: (a) When the curves are conic sections, we characterize all…
In this paper, we propose a linear method for $C^{(r,s)}$ approximation of rational B\'{e}zier curve with arbitrary degree polynomial curve. Based on weighted least-squares, the problem be converted to an approximation between two…
We consider solutions of a quasi-linear parabolic PDE with zero oblique boundary data in a bounded domain. Our main result states that the solutions can be approximated by solutions of a PDE in the whole space with a penalizing drift term.…
Many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical accuracy, which leads to the first meaningful stopping criterion for two way spectral partitioning. More…
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the curvature error. Parametric polynomial curves of low degree are used and a geometric continuity is…
The correspondence between 2-parameter families of oriented lines in ${\Bbb{R}}^3$ and surfaces in $T{\Bbb{P}}^1$ is studied, and the geometric properties of the lines are related to the complex geometry of the surface. Congruences…
The recent advent of powerful generative models has triggered the renewed development of quantitative measures to assess the proximity of two probability distributions. As the scalar Frechet inception distance remains popular, several…
Properties of the recently reported homogeneous Hilbert curves are deduced and reported. The nature of the affine transformations involved in the construction of the Hilbert curves is explored. The analytical representation of proper and…
Belyi's theorem asserts that a smooth projective curve $X$ defined over a number field can be realized as a cover of the projective line unramified outside three points. In this short paper we investigate the bejaviour of the minimal degree…
The aim of this paper is to present a new method of approximation of planar data set using only arcs or segments. The first problem we are trying to solve is the following: the CNC machines can work only with simple curves (arcs or…
We propose sublinear algorithms for probabilistic testing of the discrete and continuous Fr\'echet distance - a standard similarity measure for curves. We assume the algorithm is given access to the input curves via a query oracle: a query…
The generation of curves and surfaces from given data is a well-known problem in Computer-Aided Design that can be approached using subdivision schemes. They are powerful tools that allow obtaining new data from the initial one by means of…
Given two closed curves in a surface, we propose an algorithm to detect whether they are of the same type or not.
Let G be a graph that may be drawn in the plane in such a way that all internal faces are centrally symmetric convex polygons. We show how to find a drawing of this type that maximizes the angular resolution of the drawing, the minimum…
In this paper, tangent-, principal normal-, and binormal-wise associated curves are defined such that each of these vectors of any given curve lies on the osculating, normal, and rectifying plane of its mate, respectively. For each…
Principal curves are defined as parametric curves passing through the "middle" of a probability distribution in R^d. In addition to the original definition based on self-consistency, several points of view have been considered among which a…
In this paper, we present an algorithm for reparametrizing algebraic plane curves from a numerical point of view. That is, we deal with mathematical objects that are assumed to be given approximately. More precisely, given a tolerance…