Pythagorean Hodograph Curves

• Pythagorean hodograph curves are parametric curves whose derivative norms are perfect squares, allowing their arc lengths to be computed in closed form.
• They enable precise motion planning and tool-path generation in computer-aided geometric design, robotics, and CNC machining through features like rational offsets and rotation-minimizing frames.
• Their rich algebraic structure supports efficient interpolation, optimization via quadratic programming, and quaternionic constructions, enhancing design flexibility.

A Pythagorean hodograph (PH) curve is a rational or polynomial parametric curve for which the Euclidean norm of its derivative (hodograph) is itself a rational or polynomial function, and hence the arc length can be expressed in closed form. PH curves occupy a central place in computer-aided geometric design (CAGD), manufacturing, robotics, and geometric interpolation theory. They support unique algorithmic features such as exact parametric speed, closed-form arc length, rational offset and sweep surface constructions, and (in special cases) rational rotation-minimizing frames.

1. Algebraic Foundations and Construction of PH Curves

A polynomial PH curve in $\mathbb{R}^n$ is a parametric polynomial $r(t)$ such that the squared speed $\|r'(t)\|^2$ is a perfect square in the ring of polynomials (or rational functions) in $t$ (Altavilla et al., 22 Dec 2025, Arrizabalaga et al., 2024). The canonical planar construction uses a complex polynomial pre-image: $r'(t) = p(t)^2,\quad p(t) \in \mathbb{C}[t],$ so that

$$|r'(t)| = |p(t)|^2 = \sigma(t), \quad \sigma(t) \text{ polynomial}.$$

Integration yields the real curve $r(t) = r(0) + \int_0^t p(s)^2 ds$, with the key property that the parametric speed and arc-length function $s(t) = \int_0^t \sigma(u)\,du$ are polynomials.

In $\mathbb{R}^3$, the hodograph admits a quaternionic construction,

$r'(t) = A(t)iA^*(t), \quad A(t) \in \mathbb{H}[t],$

where $A^*(t)$ is the quaternionic conjugate and $i$ is a unit quaternion; this produces

$\|r'(t)\|^2 = |A(t)|^4,$

again a perfect square, so the arc length is a closed-form polynomial (Arrizabalaga et al., 2024, Farouki et al., 2016). Rational (non-polynomial) PH curves generalize this by admitting rational speed functions; see the partial fraction and dual quaternion methods (Schröcker et al., 2022, Kalkan et al., 2021).

2. Metric Structure and Shape Modification

Planar PH curves may be studied via the Hilbert space $C[t]$ of complex polynomials, which can be endowed with the standard $L^2$ inner product: $$\langle f, g \rangle = \int_0^1 f(t)\,\overline{g(t)}\,dt, \quad \|f\| = \sqrt{\langle f, f\rangle}.$$ A natural metric $d(f,g) = \|f-g\|$ quantifies the distance between the pre-image polynomials, hence providing a geometric measure of similarity between PH curves (Farouki et al., 2024).

Modifying a PH curve while preserving its arc-length polynomiality is achieved by perturbing the pre-image polynomial: $p(t) \rightarrow p(t) + \delta(t)$, where $\|\delta\| \le \Delta$. Constraints such as fixed endpoints and tangent directions impose quadratic and linear conditions on $\delta$, and in the case of arc-length adjustment, orthogonality constraints ($\delta \perp p$) and norm control ($\|\delta\|^2 = \Delta L$) are imposed (Farouki et al., 2024). This defines a small-dimensional system solvable via quadratic programming or direct parameterization.

3. Rational and Polynomial PH Curve Spaces, Decomposition, and Interpolation

The space of rational PH curves with a fixed polynomial tangent direction $F(t)$ is structured as a finite-dimensional vector space, parametrized via denominators $D(t)$ and admitting a canonical partial fraction decomposition: $$r(t) = p(t) + \sum_{i=1}^k \frac{p_i(t)}{(t-\beta_i)^{n_i}},$$ where $p(t)$ is polynomial PH, each $p_i(t)$ corresponds to a basis for the single-root case, and the denominators encode the loci of singularities (Schröcker et al., 2022).

Interpolation problems (e.g., $G^1$, $C^1$, $C^2$, $G^2$) in this space are reduced to linear or quadratic programming problems for the coefficients of the basis, with constraints for Hermite data and cusp avoidance given by linear inequalities on the speed's coefficients (Schröcker et al., 2023). Length prescription and optimization (e.g., minimal energy, minimal/target arc-length) are imposed as (convex) quadratic constraints (Schröcker et al., 2023).

4. Rotation-Minimizing Frames and Quaternionic Characterization

A major property of PH space curves is their ability to support rational rotation-minimizing frames (RRMFs), i.e., Bishop frames in which one axis is tangent to the path and the normal-plane axes have no instantaneous rotation about the tangent. The existence of a rational RMF (for a curve with hodograph $A(t)iA^*(t)$) is characterized by the vanishing of the rotation indicatrix: $$\Theta_A(t) = \frac{\langle A'(t), iA(t) \rangle}{\langle A(t), A(t)\rangle},$$ or, equivalently, by the possibility to factor $A(t)$ as $A_{\text{core}}(t) \cdot \delta(t)$ with $A_{\text{core}}$ having zero indicatrix (Farouki et al., 2016). Planar (trivial core) and spatial (nontrivial core) RRMFs are classified explicitly by linear algebraic relations on the quaternion coefficients, leading to complete parameterizations for cubic and quartic cases (Farouki et al., 2016, Şengüler-Çiftçi, 2013).

PH curves with rational RMFs are foundational in sweep surface, CNC tool-path, and robotics applications, enabling exact control over orientation and trajectory (Farouki et al., 2016, Şengüler-Çiftçi, 2013).

5. Extensions: B-Spline, Exponential-Polynomial, and Hermite/Arc Length Interpolation

Planar PH B-spline curves generalize PH Bézier curves by using B-spline bases for the complex pre-images: $$u(t) = \sum u_i N_{i,n}(t), \quad v(t) = \sum v_i N_{i,n}(t), \quad q(t) = [u(t) + iv(t)]^2,$$ with the normalized B-spline product yielding hodographs of prescribed degree (Albrecht et al., 2016). The arc-length function remains a B-spline, and offsets are rational NURBS.

Exponential-polynomial PH (EPH) curves extend polynomial PH to bases including exponentials, preserving many core properties (polynomial-like arc length, parametric speed, convex hull property) and supporting efficient Hermite interpolation through quaternionic construction (Romani et al., 2021). EPH curves possess flexible shape families controlled by the exponential parameter and admit fast, stable point evaluation algorithms surpassing classic de Casteljau routines (Romani et al., 2021).

For $G^2$ Hermite interpolation with arc-length constraints, degree-7 PH curves (via cubic complex pre-images) or concatenated PH biarcs provide closed-form solutions matching positions, tangents, curvatures, and length. With prescribed data from circular arcs, up to four real solutions exist; minimal total absolute curvature or deviation from constant curvature serves as selection criteria. These constructions yield approximation order 7 for single-segment and 5 for biarc-spline interpolants (Žagar, 2022, Knez et al., 2022).

6. Geometric Transformations, Framing Motions, and PH-Preserving Maps

Mappings that preserve the PH property, i.e., send every PH curve to another PH curve, are classified as conformal maps with dilation equal to the square of a real rational function. In the planar case, this restricts to holomorphic maps with derivative $(\partial \Phi/\partial z) = \Psi(z)^2$ for meromorphic $\Psi(z)$ satisfying zero-residue conditions; in higher dimensions, by Liouville's theorem, these are (anti-)Möbius transformations (Altavilla et al., 22 Dec 2025). This unifies the geometric treatment of PH curves and isothermal parametrizations.

Spatial PH curves can be constructed as the origin-trajectories of dual quaternion motion polynomials (i.e., rational framing motions). The existence and regularity of bounded rational framing motions correspond to geometric convexity conditions on the spherical part (quaternionic preimage), and the translation part can be constructed by solving linear residue and semidefinite positivity conditions, ensuring regularity and cusp-freeness (Schröcker et al., 21 May 2025, Kalkan et al., 2021).

7. Applications and Algorithmic Paradigms

PH curves underpin a broad range of applications:

• CNC machining: exact offset and rational tool-path generation (Albrecht et al., 2016, Schröcker et al., 2022)
• Robotics and motion planning: geometry-aware trajectory generation with continuous frames, optimal interpolation, and collision avoidance constraints (Arrizabalaga et al., 2022)
• CAD/CAM: arc-length-preserving interpolation and local $G^2$ spline constructions (Žagar, 2022, Knez et al., 2022)
• Sweep surface design: rational and developable sweep surfaces (Şengüler-Çiftçi, 2013)
• Model-based navigation and spatial control: e.g., PHODCOS uses PH curves to assign highly regular, differentiable frames for spacecraft guidance and trajectory optimization (Arrizabalaga et al., 2024)

Algorithmically, PH curves enable spatial path parameterizations compactly encoding geometry for optimal control, real-time kinematics, and gradient-based optimization with guaranteed regularity and explicit formulae for all geometric invariants.

---

Key references: (Altavilla et al., 22 Dec 2025, Schröcker et al., 21 May 2025, Arrizabalaga et al., 2024, Farouki et al., 2024, Schröcker et al., 2023, Schröcker et al., 2022, Arrizabalaga et al., 2022, Knez et al., 2022, Žagar, 2022, Romani et al., 2021, Kalkan et al., 2021, Albrecht et al., 2016, Farouki et al., 2016, Şengüler-Çiftçi, 2013)