Category: Blog

Learn the Hough Line Transform from beginner geometry to professional computer vision: rho-theta parameter space, accumulators, voting, peak detection, OpenCV, probabilistic variants and performance trade-offs.

Learn Smith–Waterman from local-alignment intuition to professional implementation: dynamic programming, traceback, affine gaps, substitution matrices, complexity and SIMD acceleration.

Learn Miller–Rabin from modular arithmetic intuition to professional primality testing: witnesses, strong pseudoprimes, error bounds, Python implementation and cryptographic context.

Learn Nelder–Mead from geometric intuition to professional optimisation practice: simplexes, reflection, expansion, contraction, shrinkage, stopping rules, failure modes and implementation.

Quick read: de Boor’s algorithm evaluates a B-spline curve at a chosen parameter value by repeatedly interpolating only the control points that can influence that location. It is the B-spline counterpart of de Casteljau’s method for Bézier curves and is valued for locality, efficiency and numerical stability. One-sentence answer: find the knot span containing the…

Quick read: The Matula–Beck smallest-last algorithm repeatedly removes a currently minimum-degree vertex, records the removal order, and then reads that order backwards. With the right bucket data structure, this reveals graph degeneracy and supports k-core decomposition and strong greedy-coloring orderings in O(|V| + |E|) time. One-sentence answer: peel the graph from its sparsest exposed vertex…