IB Mathematics: Applications and Interpretation HL 6 Sections80 LessonsLifetime
Voronoi diagrams AI HL
Lesson 3.6 · Voronoi Diagrams
Nearest sites, boundaries, cells, vertices and the placement of a new site.
Faith connection
Psalm 66:1 calls everyone to worship: “Make a joyful noise unto God, all ye lands” (KJV). A Voronoi diagram divides a region according to nearby places, but the psalm’s invitation reaches across every region. Wherever you are today, you can praise God. Invite a friend or family member to join you in thanking him for his goodness.
Learning objectives
By the end of this lesson, you should be able to:
- identify sites, cells, edges and vertices on a Voronoi diagram;
- interpret each cell as the region nearest to its site;
- use perpendicular bisectors to find equations of boundaries;
- determine the site nearest to a given point;
- explain how adding a site changes an existing diagram;
- solve practical questions about service areas, region areas and locations far from existing sites.
1. What is a Voronoi diagram?
A site is a chosen point, such as a hospital, shop or weather station. Its Voronoi cell contains all locations at least as close to that site as to any other site. A boundary between two cells is called an edge. Where three or more cell boundaries meet, we have a vertex.
For this lesson, “distance” means straight-line distance on a flat map unless the question states otherwise. A road network can lead to different service regions.
Boundary convention: A point inside one cell has one nearest site. A point on an edge is equally close to the two neighbouring sites. At a vertex, three or more sites can be equally close.
2. Why are the boundaries perpendicular bisectors?
Points equally distant from two sites
and
lie on the perpendicular bisector of
. The entire perpendicular bisector is a possible equal-distance line. Only the parts for which no other site is closer appear as edges in the final diagram.
Let
and
. Their midpoint is
. The segment
is horizontal, so its perpendicular bisector is:
![]()
To the left of
, locations are closer to
. To the right, they are closer to
. On
, distances to
and
are equal.
3. Construct a diagram with three sites
To construct a small Voronoi diagram:
- Plot the sites accurately.
- Find perpendicular bisectors for pairs of sites.
- Find intersections of relevant bisectors.
- Keep only the boundary portions that actually separate nearest-site regions.
- Label each cell and check it contains its site.
Pharmacies are at
,
and
. The bisector between
and
is
, while the bisector between
and
is
.
For
and
, the midpoint is
and segment
has gradient
, so its perpendicular bisector is:
![]()
All three bisectors pass through the vertex
. The actual edges run from that vertex along the portions shown in the diagram: downward on
, rightward on
, and northwest on
.
4. Find the nearest site to a point
On a clear diagram, identify the cell containing the point. With coordinates, compare squared distances; this avoids unnecessary square roots. The smallest squared distance identifies the closest site.
The pharmacies are
,
and
. A home is at
. Calculate:
![]()
![]()
![]()
Since
is the smallest, pharmacy
is closest.
5. Add a new site
A new site claims the locations closer to it than to every existing site. To update a diagram, draw perpendicular bisectors between the new site and relevant old sites; keep the parts that become nearest-site boundaries. Some existing edges shorten or disappear.
Add pharmacy
to the previous arrangement. For the home
:
![]()
Previously,
. Since
, the new pharmacy
is now closest to the home. This single comparison answers the question about the home; a full new diagram requires updating the surrounding cell boundaries as well.
6. Find an edge equation from two sites
Use midpoint and perpendicular gradient, as in Lesson 3.5. If additional sites are present, check whether the resulting line segment is genuinely an edge or whether another site is nearer along part of it.
Let
and
. The midpoint is
, and
has gradient
. The perpendicular bisector has gradient
:
![]()
![]()
With only these two sites, the full line is their Voronoi edge. With more sites, only part of it may remain visible.
7. Area of a cell within a specified region
A Voronoi cell can extend without bound. If a question asks for its area, look for a finite study region, such as a rectangle representing the town. Find where the edges meet that region and calculate the resulting polygon’s area.
A rectangular town is represented by
and
, where each unit is
km. Clinics lie at
and
. Their boundary is
.
Within the town, clinic
serves a rectangle of width
km and height
km:
![]()
Clinic
serves the other
km
. Locations exactly on the boundary are equally near both clinics.
8. Finding a point far from existing sites
In a question that specifies a finite set of eligible Voronoi vertices, evaluate each candidate’s distance to its nearest existing site. The vertex with the greatest such distance is the best candidate for placing a new site as far as possible from existing sites.
Check the wording carefully: if an entire bounded region is available and boundary locations are allowed, its boundary may also need consideration. Do not assume that a Voronoi vertex is automatically the best point without the question’s conditions.
At candidate vertex
, the nearest existing site is
km away. At candidate vertex
, the nearest site is
km away. If the question restricts the choice to these two vertices, select
: it has the larger nearest-site distance. A farther site elsewhere does not affect this comparison; the limiting site is the nearest one.
Exam and calculator tips
- Keep site, cell, edge and vertex distinct.
- An edge is part of a perpendicular bisector, not necessarily its entire line.
- Squared distances give the same nearest-site ranking as actual distances.
- When adding a site, check which old cells it takes territory from.
- For areas, identify the boundary of the study region and include units squared.
- For a proposed location far from existing sites, compare distances to its nearest site.
IB-style Paper 1 · Skill practice
Question 1 · Vocabulary
In a Voronoi diagram, what is represented by (a) a cell, (b) an edge and (c) a vertex?
Show solution
A cell contains locations closest to its site. An edge contains locations equally close to two neighbouring sites, with no other site closer. A vertex is where at least three edges meet and is typically equally distant from three or more sites.
Question 2 · Boundary equation
Sites
and
are given. Find the equation of their perpendicular bisector.
Show solution
The midpoint is
. The gradient of
is
, so the perpendicular gradient is
.
![]()
Question 3 · Nearest site
Sites are
,
and
. Which site is closest to
?
Show solution
,
, and
. Thus
is equally close to
and
and farther from
. It lies on an edge between the cells of
and
.
Question 4 · A vertex
Three sites are
,
and
. Find the Voronoi vertex and its distance from each site.
Show solution
The bisector of
is
and that of
is
. They meet at
, which is
units from each of the three sites.
Question 5 · Add a site
Sites
and
initially serve a region. A new site
is added. Determine the closest site to
before and after
is added.
Show solution
Before
is added,
and
, so
is tied between
and
. Afterward,
, so
is uniquely closest.
Question 6 · Finite cell area
A rectangular district is
km wide and
km high. Two sites lie on its horizontal centreline,
km apart, and their perpendicular bisector divides the district into two equal rectangles. Find the area of each service cell within the district.
Show solution
The district area is
km
. The bisector divides it equally, so each service cell has area
km
.
Applications and interpretation
Application 1 · Pharmacies in a neighbourhood
Pharmacies are located at
,
and
on a square-coordinate map. A home is at
.
- Find the Voronoi vertex for
,
and
. - Identify the closest pharmacy to
. - A new pharmacy
opens. Is it now closest to
?
Show solution
The bisectors
and
meet at
, the Voronoi vertex. Initially,
,
and
, so
is closest. After
opens,
, so
becomes closest.
Application 2 · A new health centre
Three villages are at
,
and
. A proposed health centre should be equally distant from all three.
- Find its coordinates.
- Find its straight-line distance from each village.
- Explain one reason why this location might not minimise residents’ travel times.
Show solution
The perpendicular bisector of
is
, and that of
is
. The health centre is at
, at distance
map units from each village. Roads, rivers or hills may make travel times differ even where straight-line distances are equal.
Application 3 · Planning service regions
A rectangular service area is
,
, with distances measured in kilometres. Two stations are at
and
.
- Find the boundary between their service cells.
- Find the area served by each station within the rectangle.
- Determine which station serves the point
.
Show solution
The midpoint of
is
; since
is horizontal, the boundary is
. Each cell is
km wide and
km high, with area
km
. Since
lies to the right of
, station
serves it.
Application 4 · Siting a shop at a Voronoi vertex
A map identifies two eligible Voronoi vertices,
and
, for a new shop. At
, the distance to its nearest existing shop is
km; at
, it is
km. The town permits the new shop only at one of these two vertices.
- Which site should be selected to maximise distance to the nearest competitor?
- How far is the selected site from its nearest existing shop, to three significant figures?
- Give one additional practical factor the shop owner should consider.
Show solution
Select
because
. Its nearest existing shop is
km away. The owner might also consider customers’ locations, transport links, rents or site availability.
Paper 1 checklist
Label sites and cells. Use perpendicular bisectors for possible boundaries, then check which portions remain edges. Compare squared distances when identifying a nearest site. For an area or an optimum location, read the permitted region and candidate conditions carefully.