Related papers: Geometry of rational helices and its applications
We characterize general pseudo-harmonic morphisms from a Riemannian manifold to a Hermitian manifold as pseudo horizontally weakly conformal maps with an additional property. We study to what extent we can (locally) describe these…
We present an approach of computing the intersection curve $\mathcal{C}$ of two rational parametric surface $\S_1(u,s)$ and $\S_2(v,t)$, one being projectable and hence can easily be implicitized. Plugging the parametric surface to the…
High-order surface reconstruction is an important technique for CAD-free, mesh-based geometric and physical modeling, and for high-order numerical methods for solving partial differential equations (PDEs) in engineering applications. In…
We present a novel shape-approximating anisotropic re-meshing algorithm as a geometric generalization of the adaptive moving mesh method. Conventional moving mesh methods reduce the interpolation error of a mesh that discretizes a given…
A new method to represent and approximate rotation matrices is introduced. The method represents approximations of a rotation matrix $Q$ with linearithmic complexity, i.e. with $\frac{1}{2}n\lg(n)$ rotations over pairs of coordinates,…
Various methods have been used to construct rational points and rational curves on rationally connected algebraic varieties. We survey recent advances in two of them, the descent and the fibration method, in a number-theoretical context…
We argue that the standard classification of isometric deformations into infinitesimal v.s. finite is inadequate for the study of compliant shell mechanisms. Indeed, many compliant shells, particularly ones that are periodically corrugated,…
We study the geometry of the space of rational curves on smooth complete intersections of low degree, which pass through a given set of points on the variety. The argument uses spreading out to a finite field, together with an adaptation to…
We prove analogues of several well-known results concerning rational morphisms between quadrics for the class of so-called quasilinear $p$-hypersurfaces. These hypersurfaces are nowhere smooth over the base field, so many of the geometric…
In characteristic $p>0$ and for $q$ a power of $p$, we compute the number of nonplanar rational curves of arbitrary degrees on a smooth Hermitian surface of degree $q+1$ under the assumption that the curves have a parametrization given by…
In this paper, we propose a method, called GridFace, to reduce facial geometric variations and improve the recognition performance. Our method rectifies the face by local homography transformations, which are estimated by a face…
We introduce a new geometric framework for the set of symmetric positive-definite (SPD) matrices, aimed to characterize deformations of SPD matrices by individual scaling of eigenvalues and rotation of eigenvectors of the SPD matrices. To…
Local features e.g. SIFT and its affine and learned variants provide region-to-region rather than point-to-point correspondences. This has recently been exploited to create new minimal solvers for classical problems such as homography,…
Neural Radiance Fields (NeRFs) provide a high fidelity, continuous scene representation that can realistically represent complex behaviour of light. Despite works like Ref-NeRF improving geometry through physics-inspired models, the ability…
We contribute a new algebraic method for computing the orthogonal projections of a point onto a rational algebraic surface embedded in the three dimensional projective space. This problem is first turned into the computation of the finite…
Rotation minimizing vector fields and frames were introduced by Bishop as an alternative to the Frenet frame. They are used in CAGD because they can be defined even the curvature vanishes. Nevertheless, many other geometric properties have…
Using orbifold Hilbert schemes, we compactify all two-dimensional Hitchin systems corresponding to types A0-tilde, D4-tilde, E6-tilde, E7-tilde, and E8-tilde, thereby obtaining four rational elliptic surfaces with C*-actions. Their singular…
Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include…
Geometric rounding of a mesh is the task of approximating its vertex coordinates by floating point numbers while preserving mesh structure. Geometric rounding allows algorithms of computational geometry to interface with numerical…
In this paper we try to further explore the linear model of the moduli of rational maps. Our attempt yields following results. Let $X\subset \mathbf P^n$ be a generic hypersurface of degree $h$. Let $R_d(X, h)$ denote the open set of the…