Parallel curve

Not to be confused with parallel transport.

Parallel curves of the graph of ${\displaystyle y=1.5\sin(x)}$ for distances ${\displaystyle d=0.25,\dots ,1.5}$

Two definitions of a parallel curve: 1) envelope of a family of congruent circles, 2) by a fixed normal distance

The parallel curves of a circle (red) are circles, too

A parallel of a curve is the envelope of a family of congruent circles centered on the curve. It generalises the concept of parallel (straight) lines . It can also be defined as a curve whose points are at a constant normal distance from a given curve. ^[1] These two definitions are not entirely equivalent as the latter assumes smoothness, whereas the former does not. ^[2]

In computer-aided design the preferred term for a parallel curve is offset curve. ^{[2] [3] [4]} (In other geometric contexts, the term offset can also refer to translation. ^[5] ) Offset curves are important, for example, in numerically controlled machining, where they describe, for example, the shape of the cut made by a round cutting tool of a two-axis machine. The shape of the cut is offset from the trajectory of the cutter by a constant distance in the direction normal to the cutter trajectory at every point. ^[6]

In the area of 2D computer graphics known as vector graphics, the (approximate) computation of parallel curves is involved in one of the fundamental drawing operations, called stroking, which is typically applied to polylines or polybeziers (themselves called paths) in that field. ^[7]

Except in the case of a line or circle, the parallel curves have a more complicated mathematical structure than the progenitor curve. ^[1] For example, even if the progenitor curve is smooth, its offsets may not be so; this property is illustrated in the top figure, using a sine curve as progenitor curve. ^[2] In general, even if a curve is rational, its offsets may not be so. For example, the offsets of a parabola are rational curves, but the offsets of an ellipse or of a hyperbola are not rational, even though these progenitor curves themselves are rational. ^[3]

The notion also generalizes to 3D surfaces, where it is called an offset surface or parallel surface. ^[8] Increasing a solid volume by a (constant) distance offset is sometimes called dilation. ^[9] The opposite operation is sometimes called shelling. ^[8] Offset surfaces are important in numerically controlled machining, where they describe the shape of the cut made by a ball nose end mill of a three-axis machine. ^[10] Other shapes of cutting bits can be modelled mathematically by general offset surfaces. ^[11]

Parallel curve of a parametrically given curve

If there is a regular parametric representation ${\displaystyle {\vec {x}}=(x(t),y(t))}$ of the given curve available, the second definition of a parallel curve (s. above) leads to the following parametric representation of the parallel curve with distance ${\displaystyle |d|}$:

${\displaystyle {\vec {x}}_{d}(t)={\vec {x}}(t)+d{\vec {n}}(t)}$ with the unit normal ${\displaystyle {\vec {n}}(t)}$.

In cartesian coordinates:

${\displaystyle x_{d}(t)=x(t)+{\frac {d\;y'(t)}{\sqrt {x'(t)^{2}+y'(t)^{2}}}}}$

${\displaystyle y_{d}(t)=y(t)-{\frac {d\;x'(t)}{\sqrt {x'(t)^{2}+y'(t)^{2}}}}\ .}$

The distance parameter ${\displaystyle d}$ may be negative. In this case, one gets a parallel curve on the opposite side of the curve (see diagram on the parallel curves of a circle). One can easily check that a parallel curve of a line is a parallel line in the common sense, and the parallel curve of a circle is a concentric circle.

Geometric properties: ^[12]

• ${\displaystyle {\vec {x}}'_{d}(t)\parallel {\vec {x}}'(t),\quad }$ that means: the tangent vectors for a fixed parameter are parallel.
• ${\displaystyle k_{d}(t)={\frac {k(t)}{1+dk(t)}},\quad }$ with ${\displaystyle k(t)}$ the curvature of the given curve and ${\displaystyle k_{d}(t)}$ the curvature of the parallel curve for parameter ${\displaystyle t}$.
• ${\displaystyle R_{d}(t)=R(t)+d,\quad }$ with ${\displaystyle R(t)}$ the radius of curvature of the given curve and ${\displaystyle R_{d}(t)}$ the radius of curvature of the parallel curve for parameter ${\displaystyle t}$.
• When they exist, the osculating circles to parallel curves at corresponding points are concentric. ^[13]
• As for parallel lines, a normal line to a curve is also normal to its parallels.
• When parallel curves are constructed they will have cusps when the distance from the curve matches the radius of curvature. These are the points where the curve touches the evolute.
• If the progenitor curve is a boundary of a planar set and its parallel curve is without self-intersections, then the latter is the boundary of the Minkowski sum of the planar set and the disk of the given radius.

If the given curve is polynomial (meaning that ${\displaystyle x(t)}$ and ${\displaystyle y(t)}$ are polynomials), then the parallel curves are usually not polynomial. In CAD area this is a drawback, because CAD systems use polynomials or rational curves. In order to get at least rational curves, the square root of the representation of the parallel curve has to be solvable. Such curves are called pythagorean hodograph curves and were investigated by R.T. Farouki. ^[14]

Parallel curves of an implicit curve

Parallel curves of the implicit curve (red) with equation ${\displaystyle x^{4}+y^{4}-1=0}$

Generally the analytic representation of a parallel curve of an implicit curve is not possible. Only for the simple cases of lines and circles the parallel curves can be described easily. For example:

Line${\displaystyle \;f(x,y)=x+y-1=0\;}$ → distance function: ${\displaystyle \;h(x,y)={\frac {x+y-1}{\sqrt {2}}}=d\;}$ (Hesse normalform)

Circle${\displaystyle \;f(x,y)=x^{2}+y^{2}-1=0\;}$ → distance function: ${\displaystyle \;h(x,y)={\sqrt {x^{2}+y^{2}}}-1=d\;.}$

In general, presuming certain conditions, one can prove the existence of an oriented distance function ${\displaystyle h(x,y)}$. In practice one has to treat it numerically. ^[15] Considering parallel curves the following is true:

• The parallel curve for distance d is the level set ${\displaystyle h(x,y)=d}$ of the corresponding oriented distance function ${\displaystyle h}$.

Properties of the distance function: ^{[12] [16]}

• ${\displaystyle |\operatorname {grad} h({\vec {x}})|=1\;,}$
• ${\displaystyle h({\vec {x}}+d\operatorname {grad} h({\vec {x}}))=h({\vec {x}})+d\;,}$
• ${\displaystyle \operatorname {grad} h({\vec {x}}+d\operatorname {grad} h({\vec {x}}))=\operatorname {grad} h({\vec {x}})\;.}$

Example:
The diagram shows parallel curves of the implicit curve with equation ${\displaystyle \;f(x,y)=x^{4}+y^{4}-1=0\;.}$
Remark: The curves ${\displaystyle \;f(x,y)=x^{4}+y^{4}-1=d\;}$ are not parallel curves, because ${\displaystyle \;|\operatorname {grad} f(x,y)|=1\;}$ is not true in the area of interest.

Further examples

Involutes of a circle

• The involutes of a given curve are a set of parallel curves. For example: the involutes of a circle are parallel spirals (see diagram).

And: ^[17]

• A parabola has as (two-sided) offsets rational curves of degree 6.
• A hyperbola or an ellipse has as (two-sided) offsets an algebraic curve of degree 8.
• A Bézier curve of degree n has as (two-sided) offsets algebraic curves of degree 4n − 2. In particular, a cubic Bézier curve has as (two-sided) offsets algebraic curves of degree 10.

Parallel curve to a curve with a corner

Parallel curves to a curve with a discontinuous normal around a corner

When determining the cutting path of part with a sharp corner for machining, you must define the parallel (offset) curve to a given curve that has a discontinuous normal at the corner. Even though the given curve is not smooth at the sharp corner, its parallel curve may be smooth with a continuous normal, or it may have cusps when the distance from the curve matches the radius of curvature at the sharp corner.

Normal fans

As described above, the parametric representation of a parallel curve, ${\displaystyle {\vec {x}}_{d}(t)}$, to a given curver, ${\displaystyle {\vec {x}}(t)}$, with distance ${\displaystyle |d|}$ is:

${\displaystyle {\vec {x}}_{d}(t)={\vec {x}}(t)+d{\vec {n}}(t)}$ with the unit normal ${\displaystyle {\vec {n}}(t)}$.

At a sharp corner (${\displaystyle t=t_{c}}$), the normal to ${\displaystyle {\vec {x}}(t_{c})}$ given by ${\displaystyle {\vec {n}}(t_{c})}$ is discontinuous, meaning the one-sided limit of the normal from the left ${\displaystyle {\vec {n}}(t_{c}^{-})}$ is unequal to the limit from the right ${\displaystyle {\vec {n}}(t_{c}^{+})}$. Mathematically,

${\displaystyle {\vec {n}}(t_{c}^{-})=\lim _{t\to t_{c}^{-}}{\vec {n}}(t)\neq {\vec {n}}(t_{c}^{+})=\lim _{t\to t_{c}^{+}}{\vec {n}}(t)}$.

Normal fan for defining parallel curves around a sharp corner

However, we can define a normal fan ^[11] ${\displaystyle {\vec {n}}_{f}(\alpha )}$ that provides an interpolant between ${\displaystyle {\vec {n}}(t_{c}^{-})}$ and ${\displaystyle {\vec {n}}(t_{c}^{+})}$, and use ${\displaystyle {\vec {n}}_{f}(\alpha )}$ in place of ${\displaystyle {\vec {n}}(t_{c})}$ at the sharp corner:

${\displaystyle {\vec {n}}_{f}(\alpha )={\frac {(1-\alpha ){\vec {n}}(t_{c}^{-})+\alpha {\vec {n}}(t_{c}^{+})}{\lVert (1-\alpha ){\vec {n}}(t_{c}^{-})+\alpha {\vec {n}}(t_{c}^{+})\rVert }},\quad }$where ${\displaystyle 0<\alpha <1}$.

The resulting definition of the parallel curve ${\displaystyle {\vec {x}}_{d}(t)}$ provides the desired behavior:

${\displaystyle {\vec {x}}_{d}(t)={\begin{cases}{\vec {x}}(t)+d{\vec {n}}(t),&{\text{if }}t<t_{c}{\text{ or }}t>t_{c}\\{\vec {x}}(t_{c})+d{\vec {n}}_{f}(\alpha ),&{\text{if }}t=t_{c}{\text{ where }}0<\alpha <1\end{cases}}}$

Algorithms

In general, the parallel curve of a Bézier curve is not another Bézier curve, a result proved by Tiller and Hanson in 1984. ^[18] Thus, in practice, approximation techniques are used. Any desired level of accuracy is possible by repeatedly subdividing the curve, though better techniques require fewer subdivisions to attain the same level of accuracy. A 1997 survey by Elber, Lee and Kim ^[19] is widely cited, though better techniques have been proposed more recently. A modern technique based on curve fitting, with references and comparisons to other algorithms, as well as open source JavaScript source code, was published in a blog post ^[20] in September 2022.

Another efficient algorithm for offsetting is the level approach described by Kimmel and Bruckstein (1993). ^[21]

Parallel (offset) surfaces

Offset surface of a complex irregular shape

Offset surfaces are important in numerically controlled machining, where they describe the shape of the cut made by a ball nose end mill of a three-axis mill. ^[10] If there is a regular parametric representation ${\displaystyle {\vec {x}}(u,v)=(x(u,v),y(u,v),z(u,v))}$ of the given surface available, the second definition of a parallel curve (see above) generalizes to the following parametric representation of the parallel surface with distance ${\displaystyle |d|}$:

${\displaystyle {\vec {x}}_{d}(u,v)={\vec {x}}(u,v)+d{\vec {n}}(u,v)}$ with the unit normal ${\displaystyle {\vec {n}}_{d}(u,v)={{{\partial {\vec {x}} \over \partial u}\times {\partial {\vec {x}} \over \partial v}} \over {|{{\partial {\vec {x}} \over \partial u}\times {\partial {\vec {x}} \over \partial v}}|}}}$.

Distance parameter ${\displaystyle d}$ may be negative, too. In this case one gets a parallel surface on the opposite side of the surface (see similar diagram on the parallel curves of a circle). One easily checks: a parallel surface of a plane is a parallel plane in the common sense and the parallel surface of a sphere is a concentric sphere.

Geometric properties: ^[22]

• ${\displaystyle {\partial {\vec {x}}_{d} \over \partial u}\parallel {\partial {\vec {x}} \over \partial u},\quad {\partial {\vec {x}}_{d} \over \partial v}\parallel {\partial {\vec {x}} \over \partial v},\quad }$ that means: the tangent vectors for fixed parameters are parallel.
• ${\displaystyle {\vec {n}}_{d}(u,v)=\pm {\vec {n}}(u,v),\quad }$ that means: the normal vectors for fixed parameters match direction.
• ${\displaystyle S_{d}=(1+dS)^{-1}S,\quad }$ where ${\displaystyle S_{d}}$ and ${\displaystyle S}$ are the shape operators for ${\displaystyle {\vec {x}}_{d}}$ and ${\displaystyle {\vec {x}}}$, respectively.

The principal curvatures are the eigenvalues of the shape operator, the principal curvature directions are its eigenvectors, the Gaussian curvature is its determinant, and the mean curvature is half its trace.

• ${\displaystyle S_{d}^{-1}=S^{-1}+dI,\quad }$ where ${\displaystyle S_{d}^{-1}}$ and ${\displaystyle S^{-1}}$ are the inverses of the shape operators for ${\displaystyle {\vec {x}}_{d}}$ and ${\displaystyle {\vec {x}}}$, respectively.

The principal radii of curvature are the eigenvalues of the inverse of the shape operator, the principal curvature directions are its eigenvectors, the reciprocal of the Gaussian curvature is its determinant, and the mean radius of curvature is half its trace.

Note the similarity to the geometric properties of parallel curves.

Generalizations

The problem generalizes fairly obviously to higher dimensions e.g. to offset surfaces, and slightly less trivially to pipe surfaces. ^[23] Note that the terminology for the higher-dimensional versions varies even more widely than in the planar case, e.g. other authors speak of parallel fibers, ribbons, and tubes. ^[24] For curves embedded in 3D surfaces the offset may be taken along a geodesic. ^[25]

Another way to generalize it is (even in 2D) to consider a variable distance, e.g. parametrized by another curve. ^[22] One can for example stroke (envelope) with an ellipse instead of circle ^[22] as it is possible for example in METAFONT. ^[26]

An envelope of ellipses forming two general offset curves above and below a given curve

More recently Adobe Illustrator has added somewhat similar facility in version CS5, although the control points for the variable width are visually specified. ^[27] In contexts where it's important to distinguish between constant and variable distance offsetting the acronyms CDO and VDO are sometimes used. ^[9]

General offset curves

Assume you have a regular parametric representation of a curve, ${\displaystyle {\vec {x}}(t)=(x(t),y(t))}$, and you have a second curve that can be parameterized by its unit normal, ${\displaystyle {\vec {d}}({\vec {n}})}$, where the normal of ${\displaystyle {\vec {d}}({\vec {n}})={\vec {n}}}$ (this parameterization by normal exists for curves whose curvature is strictly positive or negative, and thus convex, smooth, and not straight). The parametric representation of the general offset curve of ${\displaystyle {\vec {x}}(t)}$ offset by ${\displaystyle {\vec {d}}({\vec {n}})}$ is:

${\displaystyle {\vec {x}}_{d}(t)={\vec {x}}(t)+{\vec {d}}({\vec {n}}(t)),\quad }$ where ${\displaystyle {\vec {n}}(t)}$ is the unit normal of ${\displaystyle {\vec {x}}(t)}$.

Note that the trival offset, ${\displaystyle {\vec {d}}({\vec {n}})=d{\vec {n}}}$, gives you ordinary parallel (aka, offset) curves.

Geometric properties: ^[22]

• ${\displaystyle {\vec {x}}'_{d}(t)\parallel {\vec {x}}'(t),\quad }$ that means: the tangent vectors for a fixed parameter are parallel.
• As for parallel lines, a normal to a curve is also normal to its general offsets.
• ${\displaystyle k_{d}(t)={\dfrac {k(t)}{1+{\dfrac {k(t)}{k_{n}(t)}}}},\quad }$ with ${\displaystyle k_{d}(t)}$ the curvature of the general offset curve, ${\displaystyle k(t)}$ the curvature of ${\displaystyle {\vec {x}}(t)}$, and ${\displaystyle k_{n}(t)}$ the curvature of ${\displaystyle {\vec {d}}({\vec {n}}(t))}$ for parameter ${\displaystyle t}$.
• ${\displaystyle R_{d}(t)=R(t)+R_{n}(t),\quad }$ with ${\displaystyle R_{d}(t)}$ the radius of curvature of the general offset curve, ${\displaystyle R(t)}$ the radius of curvature of ${\displaystyle {\vec {x}}(t)}$, and ${\displaystyle R_{n}(t)}$ the radius of curvature of ${\displaystyle {\vec {d}}({\vec {n}}(t))}$ for parameter ${\displaystyle t}$.
• When general offset curves are constructed they will have cusps when the curvature of the curve matches curvature of the offset. These are the points where the curve touches the evolute.

General offset surfaces

General offset surfaces describe the shape of cuts made by a variety of cutting bits used by three-axis end mills in numerically controlled machining. ^[11] Assume you have a regular parametric representation of a surface, ${\displaystyle {\vec {x}}(u,v)=(x(u,v),y(u,v),z(u,v))}$, and you have a second surface that can be parameterized by its unit normal, ${\displaystyle {\vec {d}}({\vec {n}})}$, where the normal of ${\displaystyle {\vec {d}}({\vec {n}})={\vec {n}}}$ (this parameterization by normal exists for surfaces whose Gaussian curvature is strictly positive, and thus convex, smooth, and not flat). The parametric representation of the general offset surface of ${\displaystyle {\vec {x}}(t)}$ offset by ${\displaystyle {\vec {d}}({\vec {n}})}$ is:

${\displaystyle {\vec {x}}_{d}(u,v)={\vec {x}}(u,v)+{\vec {d}}({\vec {n}}(u,v)),\quad }$ where ${\displaystyle {\vec {n}}(u,v)}$ is the unit normal of ${\displaystyle {\vec {x}}(u,v)}$.

Note that the trival offset, ${\displaystyle {\vec {d}}({\vec {n}})=d{\vec {n}}}$, gives you ordinary parallel (aka, offset) surfaces.

Geometric properties: ^[22]

• As for parallel lines, the tangent plane of a surface is parallel to the tangent plane of its general offsets.
• As for parallel lines, a normal to a surface is also normal to its general offsets.
• ${\displaystyle S_{d}=(1+SS_{n}^{-1})^{-1}S,\quad }$ where ${\displaystyle S_{d},S,}$ and ${\displaystyle S_{n}}$ are the shape operators for ${\displaystyle {\vec {x}}_{d},{\vec {x}},}$ and ${\displaystyle {\vec {d}}({\vec {n}})}$, respectively.

The principal curvatures are the eigenvalues of the shape operator, the principal curvature directions are its eigenvectors, the Gaussian curvature is its determinant, and the mean curvature is half its trace.

• ${\displaystyle S_{d}^{-1}=S^{-1}+S_{n}^{-1},\quad }$ where ${\displaystyle S_{d}^{-1},S^{-1}}$ and ${\displaystyle S_{n}^{-1}}$ are the inverses of the shape operators for ${\displaystyle {\vec {x}}_{d},{\vec {x}},}$ and ${\displaystyle {\vec {d}}({\vec {n}})}$, respectively.

The principal radii of curvature are the eigenvalues of the inverse of the shape operator, the principal curvature directions are its eigenvectors, the reciprocal of the Gaussian curvature is its determinant, and the mean radius of curvature is half its trace.

Note the similarity to the geometric properties of general offset curves.

Derivation of geometric properties for general offsets

The geometric properties listed above for general offset curves and surfaces can be derived for offsets of arbitrary dimension. Assume you have a regular parametric representation of an n-dimensional surface, ${\displaystyle {\vec {x}}({\vec {u}})}$, where the dimension of ${\displaystyle {\vec {u}}}$ is n-1. Also assume you have a second n-dimensional surface that can be parameterized by its unit normal, ${\displaystyle {\vec {d}}({\vec {n}})}$, where the normal of ${\displaystyle {\vec {d}}({\vec {n}})={\vec {n}}}$ (this parameterization by normal exists for surfaces whose Gaussian curvature is strictly positive, and thus convex, smooth, and not flat). The parametric representation of the general offset surface of ${\displaystyle {\vec {x}}({\vec {u}})}$ offset by ${\displaystyle {\vec {d}}({\vec {n}})}$ is:

${\displaystyle {\vec {x}}_{d}({\vec {u}})={\vec {x}}({\vec {u}})+{\vec {d}}({\vec {n}}({\vec {u}})),\quad }$ where ${\displaystyle {\vec {n}}({\vec {u}})}$ is the unit normal of ${\displaystyle {\vec {x}}({\vec {u}})}$. (The trival offset, ${\displaystyle {\vec {d}}({\vec {n}})=d{\vec {n}}}$, gives you ordinary parallel surfaces.)

First, notice that the normal of ${\displaystyle {\vec {x}}({\vec {u}})=}$ the normal of ${\displaystyle {\vec {d}}({\vec {n}}({\vec {u}}))={\vec {n}}({\vec {u}}),}$ by definition. Now, we'll apply the differential w.r.t. ${\displaystyle {\vec {u}}}$ to ${\displaystyle {\vec {x}}_{d}}$, which gives us its tangent vectors spanning its tangent plane.

${\displaystyle \partial {\vec {x}}_{d}({\vec {u}})=\partial {\vec {x}}({\vec {u}})+\partial {\vec {d}}({\vec {n}}({\vec {u}}))}$

Notice, the tangent vectors for ${\displaystyle {\vec {x}}_{d}}$ are the sum of tangent vectors for ${\displaystyle {\vec {x}}({\vec {u}})}$ and its offset ${\displaystyle {\vec {d}}({\vec {n}})}$, which share the same unit normal. Thus, the general offset surface shares the same tangent plane and normal with${\displaystyle {\vec {x}}({\vec {u}})}$ and ${\displaystyle {\vec {d}}({\vec {n}}({\vec {u}}))}$. That aligns with the nature of envelopes.

We now consider the Weingarten equations for the shape operator, which can be written as ${\displaystyle \partial {\vec {n}}=-\partial {\vec {x}}S}$. If ${\displaystyle S}$ is invertable, ${\displaystyle \partial {\vec {x}}=-\partial {\vec {n}}S^{-1}}$. Recall that the principal curvatures of a surface are the eigenvalues of the shape operator, the principal curvature directions are its eigenvectors, the Gauss curvature is its determinant, and the mean curvature is half its trace. The inverse of the shape operator holds these same values for the radii of curvature.

Substituting into the equation for the differential of ${\displaystyle {\vec {x}}_{d}}$, we get:

${\displaystyle \partial {\vec {x}}_{d}=\partial {\vec {x}}-\partial {\vec {n}}S_{n}^{-1},\quad }$ where ${\displaystyle S_{n}}$ is the shape operator for ${\displaystyle {\vec {d}}({\vec {n}}({\vec {u}}))}$.

Next, we use the Weingarten equations again to replace ${\displaystyle \partial {\vec {n}}}$:

${\displaystyle \partial {\vec {x}}_{d}=\partial {\vec {x}}+\partial {\vec {x}}SS_{n}^{-1},\quad }$ where ${\displaystyle S}$ is the shape operator for ${\displaystyle {\vec {x}}({\vec {u}})}$.

Then, we solve for ${\displaystyle \partial {\vec {x}}}$ and multiple both sides by ${\displaystyle -S}$ to get back to the Weingarten equations, this time for ${\displaystyle \partial {\vec {x}}_{d}}$:

${\displaystyle \partial {\vec {x}}_{d}(I+SS_{n}^{-1})^{-1}=\partial {\vec {x}},}$

${\displaystyle -\partial {\vec {x}}_{d}(I+SS_{n}^{-1})^{-1}S=-\partial {\vec {x}}S=\partial {\vec {n}}.}$

Thus, ${\displaystyle S_{d}=(I+SS_{n}^{-1})^{-1}S}$, and inverting both sides gives us, ${\displaystyle S_{d}^{-1}=S^{-1}+S_{n}^{-1}}$.

See also

• Bump mapping
• Distance function and signed distance function
• Distance field
• Offset printing
• Tubular neighborhood

References

1. Willson, Frederick Newton (1898). Theoretical and Practical Graphics. Macmillan. p.  66. ISBN   978-1-113-74312-1.
2. Devadoss, Satyan L.; O'Rourke, Joseph (2011). Discrete and Computational Geometry. Princeton University Press. pp. 128–129. ISBN   978-1-4008-3898-1.
3. Sendra, J. Rafael; Winkler, Franz; Pérez Díaz, Sonia (2007). Rational Algebraic Curves: A Computer Algebra Approach. Springer Science & Business Media. p. 10. ISBN   978-3-540-73724-7.
4. Agoston, Max K. (2005). Computer Graphics and Geometric Modelling: Mathematics. Springer Science & Business Media. p. 586. ISBN   978-1-85233-817-6.
5. Vince, John (2006). Geometry for Computer Graphics: Formulae, Examples and Proofs. Springer Science & Business Media. p. 293. ISBN   978-1-84628-116-7.
6. Marsh, Duncan (2006). Applied Geometry for Computer Graphics and CAD (2nd ed.). Springer Science & Business Media. p. 107. ISBN   978-1-84628-109-9.
7. Mark Kilgard (2012-04-10). "CS 354 Vector Graphics & Path Rendering". www.slideshare.net. p. 28.
8. Agoston, Max K. (2005). Computer Graphics and Geometric Modelling. Springer Science & Business Media. pp. 638–645. ISBN   978-1-85233-818-3.
9. http://www.cc.gatech.edu/~jarek/papers/localVolume.pdf, p. 3
10. Faux, I. D.; Pratt, Michael J. (1979). Computational Geometry for Design and Manufacture. Halsted Press. ISBN   978-0-47026-473-7. OCLC   4859052.
11. Brechner, Eric (1990). Envelopes and tool paths for three-axis end milling (PhD). Rensselaer Polytechnic Institute.
12. E. Hartmann: Geometry and Algorithms for COMPUTER AIDED DESIGN. S. 30.
13. Fiona O'Neill: Planar Bertrand Curves (with Pictures!).
14. Rida T. Farouki: Pythagorean-Hodograph Curves: Algebra and Geometry Inseparable (Geometry and Computing). Springer, 2008, ISBN   978-3-540-73397-3.
15. E. Hartmann: Geometry and Algorithms for COMPUTER AIDED DESIGN. S. 81, S. 30, 41, 44.
16. Thorpe, John A. (1994-10-27). Elementary Topics in Differential Geometry. New York Heidelberg: Springer Science & Business Media. ISBN   0-387-90357-7.
17. http://faculty.engineering.ucdavis.edu/farouki/wp-content/uploads/sites/41/2013/02/Introduction-to-PH-curves.pdf Archived 2015-06-05 at the Wayback Machine , p. 16 "taxonomy of offset curves"
18. Tiller, Wayne; Hanson, Eric (1984). "Offsets of Two-Dimensional Profiles". IEEE Computer Graphics and Applications. 4 (9): 36–46. doi:10.1109/mcg.1984.275995. S2CID   9046817.
19. Elber, Gershon; Lee, In-Kwon; Kim, Myung-Soo (May–Jun 1997). "Comparing offset curve approximation methods". IEEE Computer Graphics and Applications. 17 (3): 62–71. doi:10.1109/38.586019.
20. Levien, Raph (September 9, 2022). "Parallel curves of cubic Béziers" . Retrieved September 9, 2022.
21. Kimmel, R.; Bruckstein, A.M. (1993). "Shape offsets via level sets" (PDF). Computer-Aided Design. 25 (3). Elsevier BV: 154–162. doi:10.1016/0010-4485(93)90040-u. ISSN   0010-4485. S2CID   8434463.
22. Brechner, Eric L. (1992). "5. General Offset Curves and Surfaces". In Barnhill, Robert E. (ed.). Geometry Processing for Design and Manufacturing. SIAM. pp. 101–. ISBN   978-0-89871-280-3.
23. Pottmann, Helmut; Wallner, Johannes (2001). Computational Line Geometry. Springer Science & Business Media. pp. 303–304. ISBN   978-3-540-42058-3.
24. Chirikjian, Gregory S. (2009). Stochastic Models, Information Theory, and Lie Groups, Volume 1: Classical Results and Geometric Methods. Springer Science & Business Media. pp. 171–175. ISBN   978-0-8176-4803-9.
25. Sarfraz, Muhammad, ed. (2003). Advances in geometric modeling. Wiley. p. 72. ISBN   978-0-470-85937-7.
26. Kinch, Richard J. (1995). "MetaFog: Converting METAFONT Shapes to Contours" (PDF). TUGboat. 16 (3): 233–243.
27. http://design.tutsplus.com/tutorials/illustrator-cs5-variable-width-stroke-tool-perfect-for-making-tribal-designs--vector-4346 application of the generalized version in Adobe Illustrator CS5 (also video)

• Josef Hoschek: Offset curves in the plane. In: CAD. 17 (1985), S. 77–81.
• Takashi Maekawa: An overview of offset curves and surfaces. In: CAD. 31 (1999), S. 165–173.

Further reading

• Farouki, R. T.; Neff, C. A. (1990). "Analytic properties of plane offset curves". Computer Aided Geometric Design. 7 (1–4): 83–99. doi:10.1016/0167-8396(90)90023-K.
• Piegl, Les A. (1999). "Computing offsets of NURBS curves and surfaces". Computer-Aided Design. 31 (2): 147–156. CiteSeerX   10.1.1.360.2793 . doi:10.1016/S0010-4485(98)00066-9.
• Porteous, Ian R. (2001). Geometric Differentiation: For the Intelligence of Curves and Surfaces (2nd ed.). Cambridge University Press. pp. 1–25. ISBN   978-0-521-00264-6.
• Patrikalakis, Nicholas M.; Maekawa, Takashi (2010) [2002]. Shape Interrogation for Computer Aided Design and Manufacturing. Springer Science & Business Media. Chapter 11. Offset Curves and Surfaces. ISBN   978-3-642-04074-0. Free online version.
• Anton, François; Emiris, Ioannis Z.; Mourrain, Bernard; Teillaud, Monique (May 2005). "The O set to an Algebraic Curve and an Application to Conics". International Conference on Computational Science and its Applications. Singapore: Springer Verlag. pp. 683–696.
• Farouki, Rida T. (2008). Pythagorean-Hodograph Curves: Algebra and Geometry Inseparable. Springer Science & Business Media. pp. 141–178. ISBN   978-3-540-73397-3. Pages listed are the general and introductory material.
• Au, C. K.; Ma, Y.-S. (2013). "Computation of Offset Curves Using a Distance Function: Addressing a Key Challenge in Cutting Tool Path Generation". In Ma, Y.-S. (ed.). Semantic Modeling and Interoperability in Product and Process Engineering: A Technology for Engineering Informatics. Springer Science & Business Media. pp. 259–273. ISBN   978-1-4471-5073-2.

External links

• Parallel curves on MathWorld
• Visual Dictionary of Plane Curves Xah Lee
• http://library.imageworks.com/pdfs/imageworks-library-offset-curve-deformation-from-Skeletal-Anima.pdf application to animation; patented as U.S. patent 8,400,455
• http://www2.uah.es/fsegundo/Otros/Offset/16-SanSegundoSendraSendra-1532.pdf