Related papers: Bezier curves and surfaces based on modified Berns…
The preservation of ambient isotopic equivalence under piecewise linear (PL) approximation for smooth knots are prominent in molecular modeling and simulation. Sufficient conditions are given regarding: (1) Hausdorff distance, and (2) a sum…
We propose a model to flexibly estimate joint tail properties by exploiting the convergence of an appropriately scaled point cloud onto a compact limit set. Characteristics of the shape of the limit set correspond to key tail dependence…
We introduce a method for studying reduction types of arithmetic curves and wildly ramified base change. We give new proofs of earlier results of Lorenzini and Obus-Wewers, and resolve a question of Lorenzini on the Euler characteristic of…
The main aim of this paper is to provide a unified approach to deriving identities for the Bernstein polynomials using a novel generating function. We derive various functional equations and differential equations using this generating…
It is well-known that a $d$-dimensional polynomial B\'{e}zier curve of degree $n$ can be subdivided into two segments using the famous de Casteljau algorithm in $O(dn^2)$ time. Can this problem be solved more efficiently? In this paper, we…
By identifying a family of corner cutting schemes as a dimension elevation process of Gelfond-Bezier curves, we give a Muntz type condition for the convergence of the generated control polygons to the underlying curve. The surprising…
Delineating the lesion area is an important task in image-based diagnosis. Pixel-wise classification is a popular approach to segmenting the region of interest. However, at fuzzy boundaries such methods usually result in glitches,…
Splines are one of the main methods of mathematically representing complicated shapes, which have become the primary technique in the fields of Computer Graphics (CG) and Computer-Aided Geometric Design (CAGD) for modeling complex surfaces.…
We present a new approach to the problem of $G^{k,l}$-constrained ($k,l \leq 3$) multi-degree reduction of B\'{e}zier curves with respect to the least squares norm. First, to minimize the least squares error, we consider two methods of…
In computer aided geometric design a polynomial is usually represented in Bernstein form. The de Casteljau algorithm is the most well-known algorithm for evaluating a polynomial in this form. Evaluation via the de Casteljau algorithm has…
We study the geometry and arithmetic of so-called primary Burniat surfaces, a family of surfaces of general type arising as smooth bidouble covers of a del Pezzo surface of degree 6 and at the same time as \'etale quotients of certain…
The goal of this short note is to prove that every b-spline curve or surface (generated by uniform knots, without multiplicity) may be defined as minimum of positive quadratic operator.
We develop a new kind of nonnegativity certificate for univariate polynomials on an interval. In many applications, nonnegative Bernstein coefficients are often used as a simple way of certifying polynomial nonnegativity. Our proposed…
In recent years, many useful applications of the polynomial method have emerged in finite geometry. Indeed, algebraic curves, especially those defined by R\'edei-type polynomials, are powerful in studying blocking sets. In this paper, we…
We introduce a new approach for computing curvature of sub-Riemannian manifolds. Curvature is here meant as symplectic invariants of Jacobi curves of geodesics, as introduced by Zelenko and Li. We describe how they can be expressed using a…
In this work we present WIR3D, a technique for abstracting 3D shapes through a sparse set of visually meaningful curves in 3D. We optimize the parameters of Bezier curves such that they faithfully represent both the geometry and salient…
We study deformations of plane curve singularities from an analytic point of view and obtain some new concrete results. We show some rather unexpected properties of Puiseux coefficients treated as functions on a suitably defined parameter…
The notion of Bezout matrix is an essential tool in studying broad variety of subjects: zeroes of polynomials, stability of differential equations, rational transformations of algebraic curves, systems of commuting nonselfadjoint operators,…
We show that parametric context-sensitive L-systems with affine geometry interpretation provide a succinct description of some of the most fundamental algorithms of geometric modeling of curves. Examples include the Lane-Riesenfeld…
This paper proposes a simple technique of curve and surface construction with B-splines. Given a control polygon or a control mesh together with node ordinates corresponding to all control points, a rational curve or surface is obtained by…