<p>Trigonometric and hyperbolic B-splines can be computed via recurrence relations analogous to the classical polynomial B-splines. However, in their original formulation, these two types of B-splines do not form a partition of unity and consequently do not admit the notion of control polygons with the convex hull property for design purposes. In this paper, we look into explicit expressions for their normalization and provide a recursive algorithm to compute the corresponding normalization weights. As example application, we consider the exact representation of a circle in terms of <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(C^{2n-1}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>C</mi> <mrow> <mn>2</mn> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> </math></EquationSource> </InlineEquation> trigonometric B-splines of order <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(m=2n+1\ge 3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>=</mo> <mn>2</mn> <mi>n</mi> <mo>+</mo> <mn>1</mn> <mo>≥</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation>, with a variable number of control points. We also illustrate the approximation power of trigonometric and hyperbolic splines.</p>