Master programming syntax, solve interactive challenges & run live code in Syntaxis Explore Arena →

menu_book Course Curriculum (SciPy) expand_more

Optimization

minimize() scalar objective bounds in optimization constraints in minimize() least_squares() curve_fit() root() nonlinear equations linprog() linear programming minimize_scalar()

Integration

quad() single integral dblquad() double integral cumulative_trapezoid() solve_ivp() ODE ODE event detection dense ODE output simpson() sampled integration fixed_quad() Gaussian quadrature

Statistics

stats.norm distribution t-test one sample t-test independent samples Mann–Whitney U test chi-square test Pearson correlation Spearman correlation bootstrap confidence interval

Signal Processing

find_peaks() butter() filter design sosfilt() welch() power spectrum correlate() resample() signal savgol_filter() smoothing spectrogram()

Linear Algebra & Sparse

linalg.solve() LU factorization QR decomposition SVD sparse csr_matrix sparse linear solve eigs() sparse eigenvalues distance matrix

Spatial & Interpolation

KDTree nearest neighbors ConvexHull Delaunay triangulation interp1d() CubicSpline RegularGridInterpolator griddata() distance.cdist()

SciPy / Spatial & Interpolation

ConvexHull

Learn ConvexHull in SciPy with a dedicated explanation, a concept-specific example, practical cautions, and a mastery check.

12 min read • Advanced

scipy-042.py

python

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

What to watch

Content source & attribution

Original Syntaxis Content · Original Syntaxis Content

Lesson quizzes

ConvexHull Mastery Check →

KDTree nearest neighbors

Delaunay triangulation