CPSC 203, 2025 W2
February 24, 2026
Sign up for final exam!
Today: Voronoi diagrams, lab: stacks
Thurs: Voronoi diagrams, queues
Towards learning about graphs. All fundamental to CS!
Given a (finite) set of “centres” \(c_{1}, c_{2}, \ldots, c_{k}\), a Voronoi region, \(R_{j}\) consists of the set of points nearer to centre \(c_{j}\), than to any other centre.
Together, the \(R_{j}\) regions compose the Voronoi diagram of a plane.



The quality of the new image
depends on ____________________.
Point:
Color:
Center:
Centers:
Image:
Data flow:
How much work is done? Let \(n\) denote the size of the image, \(n = width \cdot height\)
Read image:
Choose centers:
Build new image:
What’s a voronoi diagram?
Feedback (2 questions) here: 