Geometry and trigonometry: IB Maths AI HL knowledge organiser
Geometry and trigonometry for IB Maths AI HL, on one page.
Key definitions
- Graph
- A set of vertices joined by edges; the degree of a vertex is the number of edge ends meeting it.
- Eulerian circuit
- A closed walk using every edge exactly once; a connected graph has one when every degree is even.
- Minimum spanning tree
- The cheapest set of edges that joins every vertex with no cycles (Kruskal's or Prim's algorithm).
- Adjacency matrix
- A table whose entry in row
, column is the number of edges joining vertex to vertex .
Key formulas
Formulas marked with a label are given in the exam (we only say so where our formula sheet confirms it). Learn the rest.
| 3D distance ( | |
| 3D midpointIn the formula booklet | |
| Pyramid; cone; sphereIn the formula booklet | |
| Sine, cosine rules; areaIn the formula booklet | |
| Arc; sector, degreesIn the formula booklet | |
| Arc; sector, radiansIn the formula booklet | |
| IdentitiesIn the formula booklet | |
| Radians; bearings | |
| Perpendicular bisectors & Voronoi: cell edges on perpendicular bisectors of sites; largest empty circle at a vertex or on the boundary | |
| Reflection in | |
| Stretch × | |
| Rotation about | |
| Area of image | |
| Composite transformation: | |
| Vector magnitudeIn the formula booklet | |
| Scalar product; angleIn the formula booklet |
More formulas are on the full IB Maths AI HL formula sheet.
Worked example
A connected graph has vertex degrees 2, 4, 3, 3 and 2. How many edges does it have, and does it have an Eulerian circuit?
- The degrees add to twice the number of edges:
- Two vertices have odd degree
Answer: 7 edges. No Eulerian circuit, but there is an Eulerian trail between the two odd vertices
Common mistakes
- IB notation: AB as a length, vectors in columns,
vs , the variables asked for - Graph algorithms: Prim vs nearest neighbour, no method shown, bounds mixed up
- Using the 2D distance formula without the extra
-term in 3D - Using the whole circle (not the fraction
) when finding an arc length or sector area
More on what examiners see students get wrong: Examiner Insights.
You should be able to…
- Find the distance between two points and the midpoint of a line segment in three dimensions, using the 3D form of Pythagoras' theorem.
- Use the cosine rule to find a side from two sides and the included angle, and an angle from three sides.
- Find the equation of the perpendicular bisector of two points and use bisectors to construct the cells of a Voronoi diagram for a few sites.
- Use the language of graph theory, find the degree of each vertex and recognise simple, complete and connected graphs.
- Use the nearest-neighbour algorithm to find an upper bound for the travelling salesman problem, starting from different vertices to improve it.
- Build a table of least distances and use the nearest-neighbour and deleted-vertex algorithms to bound the best tour.
The printable sheet

Revise it next
- IB Maths AI HL revision notes: Geometry and trigonometry
- Practise geometry and trigonometry questions
- Skill Builders
- IB Maths AI HL formula sheet (PDF)
Other IB Maths AI HL topics: Number and algebra · Functions · Statistics and probability · Calculus · All IB Maths AI HL organisers