Convex hull computation in SciPy - Step-by-Step Execution

Concept Flow - Convex hull computation

Input: Set of points

↓

Compute convex hull using scipy.spatial.ConvexHull

↓

Identify vertices forming the hull

↓

Output hull vertices and edges

↓

Visualize or use hull for analysis

Start with points, compute hull with scipy, get vertices, then output or visualize the hull.

Execution Sample

SciPy

import numpy as np
from scipy.spatial import ConvexHull
points = np.array([[0,0],[1,1],[1,0],[0,1],[0.5,0.5]])
hull = ConvexHull(points)
print(hull.vertices)

This code computes the convex hull of 5 points and prints the indices of hull vertices.

Execution Table

Step	Action	Input/State	Output/Result
1	Input points array created	points = [[0,0],[1,1],[1,0],[0,1],[0.5,0.5]]	points array ready
2	Call ConvexHull(points)	points array	ConvexHull object created
3	Compute hull vertices	ConvexHull object	hull.vertices = [0, 2, 3, 1]
4	Print hull vertices	hull.vertices	Output: [0 2 3 1]
5	End	All steps done	Convex hull computed and vertices identified

💡 All points processed; hull vertices identified; computation complete.

Variable Tracker

Variable	Start	After Step 1	After Step 2	After Step 3	Final
points	undefined	[[0,0],[1,1],[1,0],[0,1],[0.5,0.5]]	[[0,0],[1,1],[1,0],[0,1],[0.5,0.5]]	[[0,0],[1,1],[1,0],[0,1],[0.5,0.5]]	[[0,0],[1,1],[1,0],[0,1],[0.5,0.5]]
hull	undefined	undefined	ConvexHull object	ConvexHull object with vertices [0,2,3,1]	ConvexHull object with vertices [0,2,3,1]
hull.vertices	undefined	undefined	undefined	[0, 2, 3, 1]	[0, 2, 3, 1]

Key Moments - 3 Insights

Why does hull.vertices not include the point [0.5, 0.5]?

Because [0.5, 0.5] lies inside the polygon formed by the other points, it is not on the convex hull boundary. See execution_table step 3 where vertices are identified.

What does hull.vertices represent exactly?

hull.vertices gives the indices of the input points that form the outer boundary (convex hull). This is shown in execution_table step 3.

Why do the vertices indices appear in a specific order?

The indices are ordered to form a polygon around the hull points, usually counterclockwise. This ordering helps in visualization and further analysis.

Visual Quiz - 3 Questions

Look at the execution_table at step 3, what does hull.vertices contain?

A Indices of points forming the convex hull boundary

B Indices of points inside the hull

C Coordinates of all input points

D Number of points in the input

💡 Hint

Refer to execution_table row with step 3 showing hull.vertices = [0, 2, 3, 1]

At which step does the ConvexHull object get created?

A Step 1

B Step 3

C Step 2

D Step 4

💡 Hint

Check execution_table row with step 2 describing ConvexHull object creation

If we add a point outside the current hull, how will hull.vertices change?

A It will remain the same

B It will include the new point's index in hull.vertices

C It will exclude all previous points

D It will become empty

💡 Hint

Adding an outside point changes the hull boundary, so hull.vertices updates to include it

Concept Snapshot

Convex hull computation with scipy:
- Input: array of 2D points
- Use scipy.spatial.ConvexHull(points)
- hull.vertices gives indices of hull boundary points
- Vertices ordered to form polygon
- Useful for shape analysis and visualization

Full Transcript

We start with a set of points in 2D space. Using scipy's ConvexHull function, we compute the smallest convex polygon enclosing all points. The hull object contains vertices which are indices of points forming the hull boundary. Points inside the hull are excluded from vertices. The vertices are ordered to form a polygon. This process helps in understanding the shape and boundary of point sets.

Practice

1. What does the scipy.spatial.ConvexHull function compute for a set of points?

easy

A. The smallest convex shape enclosing all points

B. The average distance between points

C. The maximum value among the points

D. The sum of all point coordinates

Solution

1. Step 1: Understand the purpose of ConvexHull

   The ConvexHull function finds the smallest convex polygon that contains all given points.

2. Step 2: Compare options with definition

   Only The smallest convex shape enclosing all points describes this smallest convex shape enclosing all points.

3. Final Answer:

   The smallest convex shape enclosing all points -> Option A

4. Quick Check:

   Convex hull = smallest convex shape [OK]

Hint: Convex hull wraps points tightly in a convex boundary [OK]

Common Mistakes:

• Confusing convex hull with average or sum calculations
• Thinking it finds maximum or minimum coordinate values
• Assuming it returns all points instead of boundary points

2. Which of the following is the correct way to import the ConvexHull class from scipy?

easy

A. from scipy.spatial import ConvexHull

B. import scipy.ConvexHull

C. from scipy import ConvexHull

D. import ConvexHull from scipy.spatial

Solution

1. Step 1: Recall correct import syntax in Python

   To import a class from a submodule, use 'from module.submodule import Class'.

2. Step 2: Match with scipy.spatial.ConvexHull

   The correct import is 'from scipy.spatial import ConvexHull'. Other options have syntax errors or wrong paths.

3. Final Answer:

   from scipy.spatial import ConvexHull -> Option A

4. Quick Check:

   Correct import = from scipy.spatial import ConvexHull [OK]

Hint: Use 'from module.submodule import Class' for importing classes [OK]

Common Mistakes:

• Using 'import scipy.ConvexHull' which is invalid syntax
• Trying 'import ConvexHull from ...' which is wrong order
• Importing directly from 'scipy' without 'spatial'

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

import numpy as np
from scipy.spatial import ConvexHull
points = np.array([[0, 0], [1, 0], [1, 1], [0, 1], [0.5, 0.5]])
hull = ConvexHull(points)
print(hull.vertices)

medium

A. [1 2 3]

B. [0 1 2 3 4]

C. [4]

D. [0 1 2 3]

Solution

1. Step 1: Identify points forming the convex hull

   The points at indices 0,1,2,3 form the square boundary; point 4 is inside.

2. Step 2: Understand hull.vertices output

   hull.vertices returns indices of points forming the hull boundary, excluding interior points.

3. Final Answer:

   [0 1 2 3] -> Option D

4. Quick Check:

   Vertices exclude inside points = [0 1 2 3] [OK]

Hint: Hull vertices exclude points inside the shape [OK]

Common Mistakes:

• Including interior points in hull vertices
• Expecting all points as hull vertices
• Misunderstanding output as coordinates instead of indices

4. The following code throws an error. What is the likely cause?

import numpy as np
from scipy.spatial import ConvexHull
points = np.array([[0, 0], [1, 1]])
hull = ConvexHull(points)
print(hull.vertices)

medium

A. Missing import statement

B. Points are not in ascending order

C. Not enough points to form a convex hull

D. Points array has wrong data type

Solution

1. Step 1: Check minimum points needed for convex hull

   Convex hull in 2D requires at least 3 points to form a polygon.

2. Step 2: Analyze given points

   Only 2 points are given, so ConvexHull cannot compute a polygon, causing an error.

3. Final Answer:

   Not enough points to form a convex hull -> Option C

4. Quick Check:

   Minimum 3 points needed for 2D hull [OK]

Hint: Convex hull needs at least 3 points in 2D [OK]

Common Mistakes:

• Assuming any number of points works
• Thinking order of points matters for hull computation
• Ignoring error message about input size

5. You have a set of 2D points representing city locations. You want to find the smallest fence enclosing all cities. Which steps correctly use scipy.spatial.ConvexHull to find the fence points?

hard

A. Import ConvexHull, sort points by x-coordinate, use hull.simplices to get fence points

B. Import ConvexHull, create numpy array of points, compute hull, use hull.vertices to get fence points

C. Import ConvexHull, compute hull, use hull.area to get fence points

D. Import ConvexHull, compute hull, use hull.points to get fence points

Solution

1. Step 1: Prepare data and compute hull

   Import ConvexHull, convert city coordinates to numpy array, then compute hull = ConvexHull(points).

2. Step 2: Extract fence points using hull.vertices

   hull.vertices gives indices of points forming the convex hull boundary (fence).

3. Final Answer:

   Import ConvexHull, create numpy array of points, compute hull, use hull.vertices to get fence points -> Option B

4. Quick Check:

   hull.vertices = fence points [OK]

Hint: Use hull.vertices for boundary points, not hull.area or hull.points [OK]

Common Mistakes:

• Using hull.area which is a number, not points
• Using hull.points which is all points, not boundary
• Sorting points manually instead of using hull.vertices