Construction and evaluation of PH curves in exponential-polynomial spaces

In the past few decades polynomial curves with Pythagorean Hodograph (for short PH curves) have received considerable attention due to their usefulness in various CAD/CAM areas, manufacturing, numerical control machining and robotics. This work deals with classes of PH curves built-upon exponential-polynomial spaces (for short EPH curves). In particular, for the two most frequently encountered exponential-polynomial spaces, we first provide necessary and sufficient conditions to be satisfied by the control polygon of the B\'{e}zier-like curve in order to fulfill the PH property. Then, for such EPH curves, fundamental characteristics like parametric speed or cumulative and total arc length are discussed to show the interesting analogies with their well-known polynomial counterparts. Differences and advantages with respect to ordinary PH curves become commendable when discussing the solutions to application problems like the interpolation of first-order Hermite data. Finally, a new evaluation algorithm for EPH curves is proposed and shown to compare favorably with the celebrated de Casteljau-like algorithm and two recently proposed methods: Wo\'zny and Chudy's algorithm and the dynamic evaluation procedure by Yang and Hong

A new class of trigonometric B-Spline Curves

We construct one-frequency trigonometric spline curves with a de Boor-like algorithm for evaluation and analyze their shape-preserving properties. The convergence to quadratic B-spline curves is also analyzed. A fundamental tool is the concept of the normalized B-basis, which has optimal shape-preserving properties and good symmetric properties

Interpolating sequences of 3D-data with C2 quintic PH B-spline curves

The goal of this paper is to present an effective method for interpolating sequences of 3D-data by means of C2 quintic Pythagorean-Hodograph (PH) B-spline curves. The strategy we propose works successfully with both open and closed sequences of 3D-points. It relies on calculations that are mostly explicit thanks to the fact that the interpolation conditions can explicitly be solved in dependence of the coefficients of the pre-image PH B-spline curve. In order to select a more suitable interpolant a functional is minimized in two remaining free coefficients of the pre-image PH B-spline curve and some angular parameters

The Relation Between Offset and Conchoid Constructions

The one-sided offset surface Fd of a given surface F is, roughly speaking, obtained by shifting the tangent planes of F in direction of its oriented normal vector. The conchoid surface Gd of a given surface G is roughly speaking obtained by increasing the distance of G to a fixed reference point O by d. Whereas the offset operation is well known and implemented in most CAD-software systems, the conchoid operation is less known, although already mentioned by the ancient Greeks, and recently studied by some authors. These two operations are algebraic and create new objects from given input objects. There is a surprisingly simple relation between the offset and the conchoid operation. As derived there exists a rational bijective quadratic map which transforms a given surface F and its offset surfaces Fd to a surface G and its conchoidal surface Gd, and vice versa. Geometric properties of this map are studied and illustrated at hand of some complete examples. Furthermore rational universal parameterizations for offsets and conchoid surfaces are provided

Geometric Hermite interpolation by rational curves of constant width

A constructive characterization of the support function for a rationally parameterized curve of constant width is given. In addition, a Hermite interpolation problem for such kind of curves is solved, which yields a method to determine a rational curve of constant width that passes through a set of free points with the corresponding tangent directions. Finally, the case of piecewise rational support functions is considered, which increases the design freedom. The procedure is presented in the general case of hedgehogs of constant width taking the advantage of projective hedgehogs, so that some constraints must be taken to ensure convexity of the desired curve.Funding for the other authors not affiliated with BCAM: Grant PID2021-124577NBI00 funded by MCIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe”. Project PID2019-104927GB-C21 funded by MCIN/AEI/10.13039/501100011033. Project UJI-B2022-19 funded by Universitat Jaume I. Project CIAICO/2021/180 funded by Generalitat Valenciana

Construction of rational curves with rational arc lengths by direct integration

A methodology for the construction of rational curves with rational arc length functions, by direct integration of hodographs, is developed. For a hodograph of the form r′(ξ)=(u2(ξ)−v2(ξ),2u(ξ)v(ξ))/w2(ξ), where w(ξ) is a monic polynomial defined by prescribed simple roots, we identify conditions on the polynomials u(ξ) and v(ξ) which ensure that integration of r′(ξ) produces a rational curve with a rational arc length function s(ξ). The method is illustrated by computed examples, and a generalization to spatial rational curves is also briefly discussed. The results are also compared to existing theory, based upon the dual form of rational Pythagorean-hodograph curves, and it is shown that direct integration produces simple low-degree curves which otherwise require a symbolic factorization to identify and cancel common factors among the curve homogeneous coordinates

A practical method for computing with piecewise Chebyshevian splines

A piecewise Chebyshevian spline space is good for design when it possesses a B-spline basis and this property is preserved under knot insertion. The interest in such kind of spaces is justified by the fact that, similarly as for polynomial splines, the related parametric curves exhibit the desired properties of convex hull inclusion, variation diminution and intuitive relation between the curve shape and the location of the control points. For a good-for-design space, in this paper we construct a set of functions, called transition functions, which allow for efficient computation of the B-spline basis, even in the case of nonuniform and multiple knots. Moreover, we show how the spline coefficients of the representations associated with a refined knot partition and with a raised order can conveniently be expressed by means of transition functions. This result allows us to provide effective procedures that generalize the classical knot insertion and degree raising algorithms for polynomial splines. We further discuss how the approach can straightforwardly be generalized to deal with geometrically continuous piecewise Chebyshevian splines as well as with splines having section spaces of different dimensions. From a numerical point of view, we show that the proposed evaluation method is easier to implement and has higher accuracy than other existing algorithms