Year 9 Mathematics · AC9M9SP03

Geometric Algorithms, Constructions and Theorems

A geometric algorithm is a precise sequence of construction steps and decisions. Good algorithms are tested on varied cases, refined for ambiguity and justified using…

Ready to project and teach

Learning goalsSay it simply

A geometric algorithm is a precise sequence of construction steps and decisions. Good algorithms are tested on varied cases, refined for ambiguity and justified using geometric properties or theorems.

By the end of this lesson, you should be able to:

  • write precise step-by-step geometric algorithms
  • use constructions and theorems as decision rules
  • test algorithms on ordinary and boundary cases
  • identify ambiguity and refine instructions
Key conceptTeach from the board

Precision matters

Each step must name the object, operation and condition clearly enough that another person can reproduce it.

Decisions can branch

An algorithm may use if/then logic, for example testing whether two constructed lengths are equal before classifying a triangle.

Test more than one friendly case

Use different orientations, sizes and edge cases. A rule that works only on the original diagram is not robust.

Refinement is mathematical reasoning

When a test fails, identify whether the issue is an ambiguous step, missing condition or incorrect theorem, then rewrite and retest.

Worked examplesWe do

Worked examples

AC9M9SP03 - Geometric Algorithms, Constructions and Theorems
Example 1

Perpendicular bisector Construct equal-radius arcs from both endpoints of a segment and join their intersections.

Example 2

Triangle classification Compare side lengths and angles using ordered conditions rather than visual appearance.

Example 3

Refinement Replace ‘draw a line through the middle’ with ‘construct the perpendicular bisector of AB’.

Example 4

Write an algorithm for constructing a perpendicular bisector.

Curriculum examplesCopied content

Australian Curriculum v9.0 — AC9M9SP03: design, test and refine algorithms involving a sequence of steps and decisions based on geometric constructions and theorems; discuss and evaluate refinements

Victoria: VC2M9SP03 — Level 9 Space. The mapping names direct Level 9 content where available and explicitly identifies supporting content where the Victorian structure separates an idea differently.

NSW: Stage 5 Path — Geometrical figures and proof, supported by Working mathematically. NSW organises Years 7–10 Mathematics through Stage 5 Core content groups and Paths rather than a one-code-per-Year-9 structure, so this lesson does not force a false one-to-one outcome.

Lesson componentAustralian CurriculumVictoriaNSW
Concept teaching + worked examplesAC9M9SP03VC2M9SP03 — Level 9 SpaceStage 5 Path — Geometrical figures and proof, supported by Working mathematically
Guided + independent practiceApplies the descriptor through progressively less-scaffolded problemsBuilds the corresponding Level 9 mathematical knowledge and fluencySupports Stage 5 Core/Path application and Working mathematically
Reasoning + assessment + masteryChecks transfer, justification, interpretation and model limitsChecks Level 9 reasoning at the mapped content depthChecks relevant Stage 5 reasoning without claiming a false Year 9 equivalent
Questions and answersWith answers
What makes an algorithm reproducible?
Clear ordered instructions and explicit decision conditions.
Why test boundary cases?
They reveal hidden assumptions or incomplete conditions.
What is refinement?
Changing the algorithm in response to test evidence, then retesting it.
Practice and reviewReady for practice
  • A diagram that looks correct proves the algorithm: Test and justify using properties, not appearance.
  • More steps always make an algorithm better: Steps should be necessary, unambiguous and efficient.
  • Testing one case is enough: Include different orientations and boundary cases.
  • Construction can rely on ‘approximately’: Defined operations and conditions are needed for reproducibility.
  1. [5 marks] Write and justify a geometric construction algorithm for a stated object.
  2. [6 marks] Test a supplied algorithm on three cases, identify a failure and refine the procedure.
  3. [7 marks] Design a decision-based algorithm to classify a family of shapes and justify each branch using geometric properties.

Review hint: A full-mark response shows the method, keeps units and restrictions visible, interprets the result in context and checks whether the answer is reasonable.

Curriculum alignmentStart here

A geometric algorithm is a precise sequence of construction steps and decisions. Good algorithms are tested on varied cases, refined for ambiguity and justified using geometric properties or theorems.

By the end of this lesson, you should be able to:

  • write precise step-by-step geometric algorithms
  • use constructions and theorems as decision rules
  • test algorithms on ordinary and boundary cases
  • identify ambiguity and refine instructions
Related resourcesKeep teaching
Teach & ExplainTeaching slides and samples

Teach this topic step by step

Explore optional teaching slide packs for classroom lessons and explanations at home.

Browse Teach & Explain · Browse Print & Go

Teachers: follow SkillrHub on TPT, then email us to request a free sample before buying. Include the year, subject and topic or curriculum code.

Request a free sample

After trying the sample, honest feedback is welcome. A TPT review is optional, where available, and does not need to be positive.