Related papers: Applying inversion to construct rational spiral cu…

The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inverse degree, and that this ratio is tight. To develop a…

We give a criterion when a planar tree-like curve, i.e. a generic immersed plane curve each double point of which cuts it into two disjoint parts, can be send by a diffeomorphism of the plane onto a curve with no inflection points. We also…

One distinguishing feature of rational curves is that they have algebraic parameterizations. Arc spaces are a way of describing approximations to parameterizations of all curves in some fixed space. Playing on these descriptions, this paper…

The optimal one-sided parametric polynomial approximants of a circular arc are considered. More precisely, the approximant must be entirely in or out of the underlying circle of an arc. The natural restriction to an arc's approximants…

By suitable examples we illustrate an algorithm for composition of inverse problems.

Reconstructing the missing parts of a curve has been the subject of much computational research, with applications in image inpainting, object synthesis, etc. Different approaches for solving that problem are typically based on processes…

The group PGL(3) of linear transformations of the projective plane acts naturally on the projective space parametrizing curves of a given degree. In this note we begin the study of the orbits of smooth curves under this action: we construct…

We develop the basic and new tools for classifying non-side-to-side tilings of the sphere by congruent triangles. Then we prove that, if the triangle has any irrational angle in degree, such tilings are: a sequence of 1-parameter families…

A nonstandard application of bivariate polynomial interpolation is discussed: the implicitization of a rational algebraic curve given by its parametric equations. Three different approaches using the same interpolation space are considered,…

In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…

A concise analytical formula is developed for the inverse of an invertible 3 x 3 matrix using a telescoping method, and is generalized to larger square matrices. The formula is confirmed using randomly generated matrices in Matlab

Consider a component of the Hilbert scheme whose general point corresponds to a degree d genus g smooth irreducible and nondegenerate curve in a projective variety X. We give lower bounds for the dimension of such a component when X is P^3,…

This paper studies circle patterns from the viewpoint of configurations. By using the topological degree theory, we extend the Koebe-Andreev-Thurston Theorem to include circle patterns with obtuse exterior intersection angles. As a…

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…

In this paper, we consider the conical Radon transform on all cones with horizontal central axis whose vertices are on a straight line. We derive an explicit inversion formula for such transform. The inversion makes use of the vertical…

We use ODEs and symmetry arguments to construct closed constant curvature space curves, first on cylinders, next on tori, at last with the Frenet-Serret equations.

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 define a suitably tame class of singular symplectic curves in 4-manifolds, namely those whose singularities are modeled on complex curve singularities. We study the corresponding symplectic isotopy problem, with a focus on rational…

Inverse reinforcement learning (IRL) is computationally challenging, with common approaches requiring the solution of multiple reinforcement learning (RL) sub-problems. This work motivates the use of potential-based reward shaping to reduce…

We use the solution set of a real ordinary differential equation which has order n which is at least 2 to construct a smooth curve C in R^n. We describe when C is a proper embedding of infinite length with finite total first curvature.