Definition
An intersection curve is the set of points that simultaneously satisfy the equations of two (or more) geometric objects of dimension two or higher, typically surfaces, in three‑dimensional Euclidean space. Formally, if $S_1$ and $S_2$ are surfaces defined respectively by the implicit equations $f_1(x,y,z)=0$ and $f_2(x,y,z)=0$, then their intersection curve $C$ is
$$
C={(x,y,z)\in\mathbb{R}^3 \mid f_1(x,y,z)=0 \ \text{and}\ f_2(x,y,z)=0}.
$$
When the intersecting objects are not both surfaces (e.g., a surface and a plane), the same definition applies, and the resulting set is still called an intersection curve provided it is one‑dimensional.
Overview
Intersection curves arise throughout mathematics, physics, engineering, and computer graphics. In classical analytic geometry they provide simple examples such as the circle produced by intersecting a plane with a sphere. In differential geometry they appear as the common integral curves of two surface manifolds, while in algebraic geometry they are studied as the components of the common zero set of two polynomial equations.
In computer‑aided design (CAD) and solid modeling, intersection curves are fundamental to Boolean operations (union, intersection, difference) and to the generation of tool paths for manufacturing. Numerical methods—such as marching algorithms, continuation techniques, or subdivision—are employed to approximate intersection curves when closed‑form solutions are unavailable.
Etymology / Origin
The term combines “intersection,” derived from the Latin intersectio (the act of cutting across), and “curve,” from the Latin curva (bent line). The phrase began to appear in the mathematical literature in the early 20th century as the study of spatial geometry and the development of computer graphics created a need to describe the one‑dimensional locus resulting from the meeting of two higher‑dimensional objects.
Characteristics
| Aspect | Description |
|---|---|
| Dimensionality | The intersection of two generic surfaces in $\mathbb{R}^3$ is a one‑dimensional set (a curve). Degenerate cases (e.g., tangential contact) may yield isolated points or no points. |
| Smoothness | If the gradients $ |
| abla f_1$ and $ | |
| abla f_2$ are linearly independent at a point of $C$, the Implicit Function Theorem guarantees that $C$ is locally a smooth curve. Points where the gradients become dependent are singularities (cusps, self‑intersections). | |
| Algebraic Degree | For algebraic surfaces defined by polynomials of degrees $d_1$ and $d_2$, Bézout’s theorem gives an upper bound of $d_1 d_2$ for the degree of the resulting algebraic curve, assuming the intersection is proper and counted with multiplicity. |
| Parametric Representation | When possible, $C$ can be expressed parametrically as $\mathbf{r}(t) = (x(t),y(t),z(t))$. Techniques include: solving one surface for a variable and substituting into the other, or using a parameterization of one surface and imposing the second constraint. |
| Numerical Computation | Common algorithms: • Marching methods: step along the curve by solving a series of constrained optimization problems. • Newton–Raphson refinement: iteratively project an initial guess onto the intersecting surfaces. • Subdivision: recursively split the domain of one surface and test for sign changes of the other. |
| Topological Types | Depending on the geometry, intersection curves can be open (e.g., a parabola resulting from a plane intersecting a paraboloid) or closed (e.g., circles, ellipses). They may consist of multiple disconnected components. |
| Applications | • CAD solid modeling and surface-surface trimming. • Collision detection in physics simulations. • Visualization of scientific data (e.g., isosurfaces intersecting). • Design of gears and cam profiles where surface contact paths are required. |
Related Topics
- Curve (mathematics) – General one‑dimensional objects in geometry.
- Surface (mathematics) – Two‑dimensional manifolds whose intersection may produce curves.
- Implicit surface – Surfaces defined by equations $f(x,y,z)=0$; a primary source of intersection curves.
- Parametric surface – Surfaces given by $\mathbf{S}(u,v)$; intersecting a parametric surface with another surface often requires solving for parameters.
- Bézout's theorem – Provides degree bounds for algebraic intersections.
- Implicit Function Theorem – Governs local smoothness of intersection curves.
- Computer‑Aided Design (CAD) – Uses intersection curves for modeling and manufacturing workflows.
- Boolean operations on solids – Intersection, union, and difference rely on determining intersection curves.
- Algebraic geometry – Studies intersection sets of polynomial equations, including intersection curves as algebraic varieties.
- Differential topology – Analyzes transversality conditions that guarantee regular (smooth) intersection curves.