Voronoi diagrams in SciPy - Step-by-Step Execution

Concept Flow - Voronoi diagrams

Input points

↓

Compute Voronoi

↓

Find edges and vertices

↓

Plot Voronoi cells

↓

Visualize regions

Start with points, compute Voronoi regions dividing space, then plot edges and vertices to visualize.

Execution Sample

SciPy

from scipy.spatial import Voronoi, voronoi_plot_2d
import matplotlib.pyplot as plt
points = [[1,1], [2,3], [3,1], [5,4]]
vor = Voronoi(points)
voronoi_plot_2d(vor)
plt.show()

This code creates Voronoi regions from 4 points and plots the diagram.

Execution Table

Step	Action	Input	Output	Notes
1	Input points	[[1,1],[2,3],[3,1],[5,4]]	Points array	Points to build Voronoi from
2	Compute Voronoi	Points array	Voronoi object	Calculates edges, vertices, regions
3	Extract vertices	Voronoi object	Vertices array	Coordinates of Voronoi vertices
4	Extract ridge vertices	Voronoi object	Pairs of vertex indices	Edges between vertices
5	Plot Voronoi	Voronoi object	Plot on matplotlib	Visualizes cells and edges
6	Show plot	Plot	Window with diagram	Displays Voronoi diagram
7	End	N/A	N/A	Execution complete

💡 All points processed and Voronoi diagram displayed

Variable Tracker

Variable	Start	After Step 2	After Step 3	After Step 4	Final
points	[[1,1],[2,3],[3,1],[5,4]]	[[1,1],[2,3],[3,1],[5,4]]	[[1,1],[2,3],[3,1],[5,4]]	[[1,1],[2,3],[3,1],[5,4]]	[[1,1],[2,3],[3,1],[5,4]]
vor	N/A	Voronoi object	Voronoi object	Voronoi object	Voronoi object
vertices	N/A	N/A	[array of vertex coords]	[array of vertex coords]	[array of vertex coords]
ridge_vertices	N/A	N/A	N/A	[list of vertex index pairs]	[list of vertex index pairs]

Key Moments - 2 Insights

Why do some Voronoi vertices have coordinates outside the range of input points?

Voronoi vertices can lie outside the convex hull of input points because the diagram extends infinitely; see execution_table step 3 where vertices include points beyond inputs.

What does a ridge vertex pair of [-1, 2] mean in the Voronoi object?

A -1 index means the edge extends to infinity in that direction; this is shown in execution_table step 4 where ridge vertices include -1 for infinite edges.

Visual Quiz - 3 Questions

Look at the execution_table at step 3, what is stored in 'vertices'?

A Coordinates of Voronoi vertices

B Input points

C Pairs of ridge vertices

D Plot object

💡 Hint

Check the 'Output' column in step 3 of execution_table

At which step does the code calculate edges between Voronoi vertices?

A Step 2

B Step 3

C Step 4

D Step 5

💡 Hint

Look for 'Extract ridge vertices' in execution_table step 4

If we add more points, how will the 'vertices' variable change after step 3?

A It will have fewer vertices

B It will have more vertices

C It will stay the same

D It will become empty

💡 Hint

More points create more Voronoi regions and vertices, see variable_tracker for 'vertices'

Concept Snapshot

Voronoi diagrams split space by closest points.
Use scipy.spatial.Voronoi(points) to compute.
Vertices are intersection points of edges.
Edges can be finite or infinite (-1 index).
Plot with voronoi_plot_2d(vor) and plt.show().

Full Transcript

Voronoi diagrams divide space into regions closest to each input point. We start by giving a list of points. Then, scipy's Voronoi function calculates the edges and vertices that form these regions. Some vertices can be outside the input points range because the diagram extends infinitely. Edges are pairs of vertices; if an edge extends infinitely, one vertex index is -1. Finally, we plot the diagram using voronoi_plot_2d and show it with matplotlib. This process helps visualize how space is split by proximity to points.

Practice

1. What does a Voronoi diagram represent in data science?

easy

A. It reduces data dimensions for visualization

B. It divides space into regions closest to given points

C. It predicts future data points using regression

D. It clusters data points into groups based on similarity

Solution

1. Step 1: Understand Voronoi diagram concept

   A Voronoi diagram splits space so each region contains points closest to one seed point.

2. Step 2: Compare options with definition

   Only It divides space into regions closest to given points describes this splitting of space by proximity to points.

3. Final Answer:

   It divides space into regions closest to given points -> Option B

4. Quick Check:

   Voronoi = space division by closest points [OK]

Hint: Voronoi = closest region per point [OK]

Common Mistakes:

• Confusing Voronoi with clustering
• Thinking it predicts or reduces data
• Mixing with regression or PCA

2. Which is the correct way to create a Voronoi diagram using scipy for points stored in variable points?

easy

A. vor = Voronoi(points)

B. vor = scipy.Voronoi(points)

C. vor = spatial.Voronoi(points)

D. vor = scipy.spatial.Voronoi(points)

Solution

1. Step 1: Recall scipy Voronoi syntax

   The Voronoi class is in scipy.spatial module, so full call is scipy.spatial.Voronoi(points).

2. Step 2: Check options for correct import and usage

   Only vor = scipy.spatial.Voronoi(points) uses full correct path. Others miss module or import.

3. Final Answer:

   vor = scipy.spatial.Voronoi(points) -> Option D

4. Quick Check:

   Use scipy.spatial.Voronoi for Voronoi diagrams [OK]

Hint: Use full module path: scipy.spatial.Voronoi(points) [OK]

Common Mistakes:

• Omitting 'spatial' module
• Using incomplete import paths
• Calling Voronoi without module prefix

3. What will be the output of the following code snippet?

import numpy as np
from scipy.spatial import Voronoi
points = np.array([[0, 0], [1, 0], [0, 1]])
vor = Voronoi(points)
print(len(vor.regions))

medium

A. 3

B. 4

C. 7

D. 5

Solution

1. Step 1: Understand Voronoi regions attribute

   vor.regions is a list of all Voronoi regions, including empty and infinite ones, not just one per input point.

2. Step 2: Check typical region count for 3 points

   For 3 points forming a triangle, scipy returns 7 regions (including empty and infinite regions).

3. Final Answer:

   7 -> Option C

4. Quick Check:

   Voronoi regions count includes empty and infinite regions [OK]

Hint: Regions count includes empty and infinite regions [OK]

Common Mistakes:

• Thinking regions count == points count
• Ignoring empty or infinite regions
• Confusing regions with vertices

4. Identify the error in this code that tries to create a Voronoi diagram:

from scipy.spatial import Voronoi
points = np.array([[0, 0], [1, 1], [1, 0]])
vor = Voronoi(points)
print(vor.vertices)

medium

A. Missing import for numpy

B. Voronoi requires 3D points, not 2D

C. points must be a numpy array, not a list

D. Voronoi class does not have vertices attribute

Solution

1. Step 1: Check input type for Voronoi

   np.array is used without importing numpy as np.

2. Step 2: Identify error cause

   Missing import numpy as np causes NameError: name 'np' is not defined.

3. Final Answer:

   Missing import for numpy -> Option A

4. Quick Check:

   Import numpy as np before np.array [OK]

Hint: import numpy as np before using np.array [OK]

Common Mistakes:

• Missing import for numpy
• Assuming 3D points required
• Thinking vertices attribute missing

5. You have 2D points representing store locations. You want to find the area closest to each store using scipy Voronoi. Which approach correctly calculates the polygon area for each Voronoi region?

hard

A. Use vor.regions to get indices, then vor.vertices to get polygon points, and calculate polygon area

B. Calculate distance between points and sum them for area

C. Use vor.points directly as polygon vertices for area

D. Sum the lengths of edges in vor.ridge_vertices for area

Solution

1. Step 1: Understand Voronoi region structure

   Each region is defined by indices in vor.regions pointing to vor.vertices coordinates forming polygons.

2. Step 2: Calculate polygon area from vertices

   Extract vertices for each region polygon and compute area using polygon area formula.

3. Final Answer:

   Use vor.regions indices with vor.vertices to get polygons and calculate area -> Option A

4. Quick Check:

   Regions + vertices = polygon area calculation [OK]

Hint: Use vor.regions and vor.vertices to get polygons [OK]

Common Mistakes:

• Using points instead of vertices for polygons
• Summing distances instead of area
• Using ridge lengths as area