liveBook · Manning

Tangent

As explained in Advanced Algorithms and Data Structures

A tangent is a line that touches a curve at a point and represents its instantaneous direction there.

A tangent is a line describing a curve’s direction at a point. For a symmetric quadratic Bézier curve, the tangent parallel to the endpoint segment lies halfway between that segment and the control point. section 15.4.4

Tangents support Bézier intersection testing by helping to:

  • Find vertical and horizontal turning points. section 15.4.4
  • Split curves into monotonic sections that can be approximated with segments. section 15.4.4

Using tangents during subdivision

When two quadratic Bézier curves have overlapping bounding boxes, compute axis-parallel tangents and split each curve at those points. Compare only overlapping sections, then halve sections until segment approximation meets the chosen error threshold.

How Advanced Algorithms and Data Structures covers it

How deep it goes
Explains tangent placement and its algorithmic use, but defers generic Bézier clipping details.
Examples
Uses symmetric quadratic Bézier curves, axis-parallel tangents, subdivision diagrams, and segment approximations.
What it assumes
Assumes familiarity with Bézier curves, control points, segments, and bounding boxes.
What you can do after
Apply tangents to split Bézier curves into monotonic sections for approximate intersection testing.
How it connects
Connects tangents with quadratic Bézier curves, bounding boxes, interval subdivision, monotonicity, and segment intersection.

Also explained in

Compare how 2 books explain tangent →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Advanced Algorithms and Data Structures. The section links point to the parts of the book it draws on.