Toxic Waste Dump Problem (DP IB Applications & Interpretation (AI)): Revision Note

Toxic waste dump problem

What is the toxic waste dump problem?

  • The toxic waste dump problem is the name given to the general idea of finding the point on a Voronoi diagram which is furthest from any of the sites

  • It is given this name because of the common problem of finding a place to put a toxic waste dump that is equally far away from any inhabited area

    • For example, if a province contains five towns a Voronoi diagram could be used to find the point within the province which is furthest from each town

  • The toxic waste dump problem is more of an idea than a specific problem

    • The same concept could be applied to other contexts such as

      • Finding a position for a new supermarket that is equally far from all competitors

      • Finding a place to plant a new tree that is equally far from other trees competing for water resources

      • Finding the quietest place to enjoy a picnic that is equally far from other noisy groups of people

    • Note that the term equally far is used in all of the above examples

What is the largest empty circle?

  • The largest empty circle is the largest possible circle constructed on a Voronoi diagram that contains no sites

    • The centre of the circle is one of the vertices of a cell

    • The radius of the circle is the distance from the vertex to the closest site

      • The closest site will be on the circumference

      • Use Pythagoras’ theorem to find the distance

  • There may be a scale to convert the distance found on the Voronoi diagram into a distance in real life

How do I use a Voronoi diagram to find the furthest point from any of the sites?

  • The furthest point from any of the sites is always either

    • at one of the vertices of the cells

    • somewhere on a boundary of the diagram

  • In your exam, the solution will always be one of the cell vertices

  • To find the furthest point:

    • Find the largest empty circle centred at each vertex

    • Choose the vertex whose largest empty circle has the biggest radius

  • This is done by constructing the largest empty circle

Graph showing intersecting red circles labelled A-E, with two blue cross markers indicating possible centre locations for the largest empty circle.
Example of finding the largest empty circles

Examiner Tips and Tricks

You might need to find the coordinates of a vertex. You can use your GDC to find the intersection of perpendicular bisectors.

Worked Example

The Voronoi diagram below shows four cities at the sites A, B, C and D.  The coordinates of the points X and Y are open parentheses 5 over 4 space comma space 7 over 4 close parentheses and open parentheses 5 over 2 comma 3 over 2 close parentheses respectively.

3-4-2-diagram-for-we-2-1

Determine the optimal position where a toxic waste site could be located and, given that 1 unit represents 50 km, find the distance from this point to its nearest city.

3-4-2-toxic-waste-dump-problem-we-solution

You've read 0 of your 5 free revision notes this week

Unlock more, it's free!

Join the 100,000+ Students that ❤️ Save My Exams

the (exam) results speak for themselves:

Amber

Author: Amber

Expertise: Maths Content Creator

Amber gained a first class degree in Mathematics & Meteorology from the University of Reading before training to become a teacher. She is passionate about teaching, having spent 8 years teaching GCSE and A Level Mathematics both in the UK and internationally. Amber loves creating bright and informative resources to help students reach their potential.

Dan Finlay

Reviewer: Dan Finlay

Expertise: Maths Subject Lead

Dan graduated from the University of Oxford with a First class degree in mathematics. As well as teaching maths for over 8 years, Dan has marked a range of exams for Edexcel, tutored students and taught A Level Accounting. Dan has a keen interest in statistics and probability and their real-life applications.