相关论文: A matrix-based approach to properness and inversio…

A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…

We present a novel, deterministic, and efficient method to detect whether a given rational space curve is symmetric. By using well-known differential invariants of space curves, namely the curvature and torsion, the method is significantly…

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…

Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations. Using the "Sender-Receiver" model, we propose quantum algorithms for matrix operations such as matrix-vector product,…

Obtaining the inverse of a large symmetric positive definite matrix $\mathcal{A}\in\mathbb{R}^{p\times p}$ is a continual challenge across many mathematical disciplines. The computational complexity associated with direct methods can be…

In this paper we show that a surface in P^3 parametrized over a 2-dimensional toric variety T can be represented by a matrix of linear syzygies if the base points are finite in number and form locally a complete intersection. This…

The advancements in neural rendering have increased the need for techniques that enable intuitive editing of 3D objects represented as neural implicit surfaces. This paper introduces a novel neural algorithm for parameterizing neural…

We propose a unified method to visualize curvature on planar curves and surfaces of revolution using the tangential angle parameter. For plane curves, placing markers at equal increments of the tangential angle reveals local bending…

Based on the computation of a superset of the implicit support, implicitization of a parametrically given hyper-surface is reduced to computing the nullspace of a numeric matrix. Our approach exploits the sparseness of the given parametric…

We classify real families of minimal degree rational curves that cover an embedded rational surface. A corollary is that if the projective closure of a smooth surface is not biregular isomorphic to the projective closure of the unit-sphere,…

Given a planar curve defined by means of a real rational parametrization, we prove that the affine values of the parameter generating the real singularities of the offset are real roots of a univariate polynomial that can be derived from…

We study certain linear algebra algorithms for recursive block matrices. This representation has useful practical and theoretical properties. We summarize some previous results for block matrix inversion and present some results on…

Non-negative matrix factorization (NMF) is a prob- lem with many applications, ranging from facial recognition to document clustering. However, due to the variety of algorithms that solve NMF, the randomness involved in these algorithms,…

A set of fundamental matrices relating pairs of cameras in some configuration can be represented as edges of a "viewing graph". Whether or not these fundamental matrices are generically sufficient to recover the global camera configuration…

The various non-linear transformations incurred by the rays in an optical system can be modelled by matrix products up to any desired order of approximation. Mathematica software has been used to find the appropriate matrix coefficients for…

We prove that a general planar NURBS curve parametrization $\phi: [u_0,u_m] \xrightarrow{} C \subset \mathbb{R}^2$ admits an inverse map $\phi^{-1}: C \xrightarrow{} [u_0,u_m]$ defined by rational splines. More specifically, we construct a…

We consider inverse problems for non-linear hyperbolic and elliptic equations and give an introduction to the method based on the multiple linearization, or on the construction of artificial sources, to solve these problems. The method is…

Using three different approaches, we analyze the complexity of various birational maps constructed from simple operations (inversions) on square matrices of arbitrary size. The first approach consists in the study of the images of lines,…

The classical Whitney formula relates the number of times an oriented plane curve cuts itself to its rotation number and the index of a base point. In this paper we generalize Whitney's formula to curves on an oriented punctured surface. To…

In this article one-sided (b, c)-inverses of arbitrary matrices as well as one-sided inverses along a (not necessarily square) matrix, will be studied. In adddition, the (b, c)-inverse and the inverse along an element will be also…