Skip to content

Pythagorean Hodograph Curve

A planar polynomial curve whose derivative components have a polynomial-square norm, giving exact polynomial arc length on regular intervals.

Version
v1 · 2026-10-03 · History
Domain-specific #
13536
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Computer Aided Geometric Design → Mathematics
Aliases
PH Curve, Polynomial Pythagorean Hodograph Curve

Core Idea

A planar polynomial parametric curve \(r(t)=(x(t),y(t))\) has a Pythagorean hodograph when its derivative components satisfy [ x'(t)2+y'(t)2=\sigma(t)^2 ] for some polynomial \(\sigma\). The derivative vector is the hodograph, and the identity is a polynomial analogue of a Pythagorean triple. Where the curve is regular and the sign of \(\sigma\) is fixed, speed is \(|\sigma|\), so arc length is obtained by integrating a polynomial rather than a square root. For a planar curve, dividing the rotated tangent by speed also gives a rational normal and, away from singularities, a rational parametrization of a constant-distance offset.[1]

The exactness is structural, not merely a more accurate numerical approximation. Yet it has boundaries: changing parameter intervals across a zero of \(\sigma\), moving from polynomial to rational PH curves, or asserting spatial rational normals changes which conclusions survive. The polynomial condition itself, rather than a promise of smoothness, shape quality or machine feed, identifies the class.[1][2]

Structural Signature

Sig role-phrases:

  1. Polynomial parametrization: coordinates are polynomial functions of a parameter.
  2. Derivative vector: the two components of \(r'(t)\) define the hodograph.
  3. Square-norm identity: their squared Euclidean norm is exactly a polynomial square.
  4. Regular interval: speed is nonzero and \(\sigma\) keeps sign on the interval being used for a single polynomial length formula.
  5. Geometric consequences: planar tangent, normal, length and offset operations become algebraically tractable under the relevant regularity conditions.
  6. Application layer: path fitting or feed scheduling uses those properties but is not built into the definition.[1][3]

Condensed: polynomial path + Pythagorean derivative norm → polynomial speed and planar rational offset structure, subject to regularity.

What It Is Not

  • Not an arbitrary curve with a hodograph. Every differentiable parametrized curve has derivative vectors; few satisfy this exact square identity.
  • Not a guarantee of constant-speed motion. The parameter speed is generally \(|\sigma(t)|\), which varies with \(t\); motion control must assign a separate time law.[3]
  • Not a guarantee of a globally polynomial unsigned arc-length formula across stationary/sign-changing points. Integrating \(|\sigma|\) may require splitting the parameter domain.
  • Not a generic spatial rational-normal theorem. Spatial PH curves need not have rational Frenet normal and binormal; planar offset claims cannot simply be copied to 3D.
  • Not equivalent to every rational PH curve. Rational-path arc-length behavior requires its own analysis and can fail to be rational even when a PH condition is asserted.[2]

Scope of Application

Farouki and Sakkalis characterized planar polynomial PH curves and highlighted polynomial arc length and rational planar offsets. The identity can be constructed from polynomial functions \(u,v,w\) by setting [ x'=w(u2-v2),\qquad y'=2wuv,\qquad \sigma=w(u2+v2). ] Then \(x'^2+y'^2=\sigma^2\). However, the speed is \(|w|(u^2+v^2)\), not \(\sigma\) regardless of sign. For a single polynomial length expression, choose an interval where \(w\) has fixed sign and the path remains regular. The construction demonstrates the property; it does not guarantee a desired shape, absence of loops or suitable curvature.[1]

For a planar offset at signed distance \(d\), write \(N(t)=(-y',x')/\|r'\|\) on a regular interval. Because the numerator is polynomial and the denominator equals a signed polynomial there, \(N\) is rational, and \(r_d(t)=r(t)+dN(t)\) is rational. Rational representation does not ensure that the offset is free of cusps or self-intersections; trimming and application-specific validity remain separate geometric work.

In CNC interpolation, a polynomial arc-length map permits a more analytic reduction of parameter stepping to monotone polynomial equations. It does not by itself solve jerk, acceleration, sampling or controller constraints. The original interpolator work treats those as an application built on PH geometry.[3]

Clarity

State whether the object is a planar polynomial PH curve, a spatial PH curve, or a later rational PH variant. Write the derivative-norm equation and inspect zeros of \(\sigma\) before claiming a global length formula. When saying an offset is “exact,” specify that its planar parametrization is rational; do not infer manufacturing accuracy from symbolic exactness. Likewise, “exact arc length” means the continuous curve's length is algebraically integrable under the stated interval, not that any chosen sample or feedrate is exact.[1][3]

Manages Complexity

A generic polynomial parametric curve often has a square-root speed whose length integral is not polynomial. The PH constraint moves that difficulty into curve construction: one chooses derivative components that satisfy a sum-of-squares identity, thereby simplifying downstream length, unit-direction and offset calculations. This trades unrestricted polynomial-shape freedom for tractable geometric operations. It is particularly valuable when many offsets or parameter-to-distance conversions are needed, but the constructed curve still must be checked for fit, smoothness and singularities.

Abstract Reasoning

Start with the proposed polynomial path and differentiate it. Factor or otherwise test whether \(x'^2+y'^2\) is a perfect polynomial square. If so, partition the parameter domain at zeros/sign changes and identify regular intervals. Integrate the nonnegative speed to obtain length there. For planar offsets, form the rational unit normal only where speed is nonzero. For motion planning, invert the length-to-parameter relation or solve the appropriate polynomial stepping equations under a specified feed profile; the PH identity is a helpful input, not the controller.[1][3]

Knowledge Transfer

The polynomial-square identity transfers from geometric design to machining and path planning because all need reliable geometry along a parametrized path. What transfers is the exact algebraic relation, not an assurance of safe motion or a universal 3D offset formula. Spatial PH constructions can share polynomial speed yet require separate frame and normal-field conditions. Rational PH curves likewise require separate arc-length arguments.[3][2]

Examples

An explicit planar PH cubic

As an author-derived algebraic witness of the original polynomial-square definition—not a measured design from the cited paper—take \(x(t)=t^3/3-t\) and \(y(t)=t^2\). Then \(x'=t^2-1\), \(y'=2t\), and [ (t2-1)2+(2t)2=(t2+1)^2. ] The speed is \(t^2+1>0\), so the length from \(a\) to \(b\), for \(a<b\), is \((b^3/3+b)-(a^3/3+a)\). The unit normal \((-2t,t^2-1)/(t^2+1)\) is rational, making any fixed-distance planar offset rational.

Mapped back: the polynomial path is \(r(t)=(t^3/3-t,t^2)\); its derivative components satisfy the displayed square-norm identity with \(\sigma=t^2+1\). Since \(\sigma\) is positive on every real interval, the length integral has the stated polynomial antiderivative. Dividing the rotated derivative by \(\sigma\) yields the rational planar normal; neither exact length nor the normal substitutes for the identity test.

Planar design offset

A source-linked design construction takes a regular planar PH pitch or centerline \(r(t)\), computes its rational unit normal \(N(t)\), and forms a fixed-distance offset \(r(t)+dN(t)\). Farouki and Sakkalis establish the rational-offset property, and the later original cam-profile paper applies PH pitch-curve segments so that both pitch and offset cam shape have exact CAD representations. This describes that construction, not a claimed tested cam geometry or tolerance result. Rational representation alone does not remove self-intersections, cusps or the need to trim an offset before manufacturing.[1][4]

Mapped back: a planar polynomial pitch segment supplies the path; its PH square-norm identity makes speed polynomial on a regular sign-consistent interval; its rotated tangent divided by that speed gives rational \(N\); fixed \(d\) gives a rational offset. A particular cam's trimming and fit remain separate tests.

Parameter stepping in a machine controller

Farouki and Shah's original real-time CNC interpolator uses the PH arc-length relation to step a parameter so the tool follows a prescribed travel increment. On a regular segment, the controller solves a polynomial length equation rather than repeatedly numerically integrating a square-root speed. This is a source-attested algorithmic case, not evidence that a particular machine achieved a stated tolerance. Feed choice, acceleration bounds, axis limits and collisions remain external.[3]

Mapped back: the programmed planar polynomial tool path must first pass the PH identity test; a regular sign-consistent segment supplies a monotone polynomial arc-length map. The controller uses that map for parameter stepping, while a rational planar normal is not required for this application. The separate motion schedule determines the requested distance increments.

Structural Tensions

Exact downstream geometry versus constrained shape space. The PH constraint yields polynomial length and rational planar offsets, reducing repeated numerical approximation. It also excludes many polynomial shapes of a fixed degree, so matching a desired boundary may require more segments or accepted fit error. Relaxing the constraint restores shape freedom but loses those exact downstream computations. Diagnostic: what fit error and segment count buy the computational simplification?

Symbolic offset versus usable offset. Exact rational representation permits precise evaluation and exchange of a cam or tool offset, but an offset may self-intersect, cusp or leave the intended physical boundary. Numerical trimming can yield a usable path but forfeits some symbolic simplicity and introduces tolerance choices. Diagnostic: does the chosen offset remain regular and correctly trimmed over its manufacturing interval?

Arc-length exactness versus physical feed. Polynomial length lets a CNC interpolator compute parameter steps from commanded travel without quadrature; choosing aggressive increments can still violate axis acceleration or collision constraints. Slower conservative stepping protects machine dynamics but may underuse the path's exact computational advantage. Diagnostic: which feed, acceleration, axis and collision constraints govern the schedule beyond the length equation?[3]

Structural–Framed Character

This class lies toward the structural end of the spectrum: a Pythagorean identity in the curve's derivative components, not a cultural convention, defines membership. Evaluative weight is low—the property is exact whether or not a designer values it. Human CAD practice motivates many applications but does not create the mathematical identity, and no institution is constitutive of its origin. The vocabulary travels literally among planar curve design, path planning and computational geometry where the same polynomial-norm test is applied. Importing “Pythagorean hodograph” to a non-Euclidean path without proving the corresponding identity is analogy rather than recognition of the same class. Its character: an exact geometric structure with domain-bound polynomial and metric prerequisites.

Structural Core vs. Domain Accent

The skeletal relation is constraining an upstream representation to simplify downstream calculation; that might motivate a future prime only after independent cross-domain evidence. The mathematical mechanism here is precise: a planar polynomial curve's hodograph components satisfy a polynomial Pythagorean identity, making polynomial speed and related exact computations possible under stated regularity. The named class does not clear the prime bar because this metric and algebraic test cannot be transplanted into unrelated domains without becoming metaphor. Live Differentiable Curve is a nearer strict genus than broad Curve; live Hodograph names a derivative-vector representation, not this entire curve class. A possible future Polynomial Parametric Curve intermediate could make the DAG placement more informative.

This entry is a kind of Differentiable curve.

The strict parent is `domain_specific:differentiable_curve`. This does not establish an edge to Hodograph: every PH curve has derivative vectors, but a type-of relation between the curve and the vector locus would conflate carriers. Any composition relation needs a separate DAG review.

Relationships to Other Abstractions

Local relationship map for Pythagorean Hodograph CurveParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.PythagoreanHodograph CurveDOMAINDomain-specific abstraction: Differentiable curve — is a kind ofDifferentiablecurveDOMAIN

Current abstraction Pythagorean Hodograph Curve Domain-specific

Parents (1) — more general patterns this builds on

  • Pythagorean Hodograph Curve is a kind of Differentiable curve Domain-specific

    Every polynomial Pythagorean-hodograph curve is differentiable.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Pythagorean Hodograph Curve sits in a sparse region of the domain-specific corpus (86th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2551 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With

Hodograph alone is the path or representation of derivative vectors. General polynomial curve lacks the square-norm restriction. Rational PH curve is a related but different construction with different length claims. Spatial PH curve can retain polynomial speed without inheriting all planar normal/offset properties. Constant-speed parametrization is a timing property, not the PH identity.[1][2]

References

[1] R. T. Farouki and T. Sakkalis, “Pythagorean hodographs” (1990), original definition and planar polynomial consequences. registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h

[2] R. T. Farouki, “Arc lengths of rational Pythagorean–hodograph curves”, original correction highlighting the rational-variant boundary. registry ↩a ↩b ↩c ↩d

[3] R. T. Farouki and S. Shah, “Real-time CNC interpolators for Pythagorean-hodograph curves” (1996), original interpolation application. registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h

[4] R. T. Farouki and collaborators, “Design of rational cam profiles with Pythagorean-hodograph curves”, original cam-design paper; abstract checked. registry ↩