•19 min read•
Convex Hull Algorithms
Computing the smallest enclosing polygon of a point set, from Graham's 1972 scan to Jarvis's march, and its uses in graphics and collision detection.
Read more →2 posts about algorithms
Computing the smallest enclosing polygon of a point set, from Graham's 1972 scan to Jarvis's march, and its uses in graphics and collision detection.
Read more →The link-analysis algorithm Page and Brin devised at Stanford in the late 1990s, how the random-surfer model ranks the web, and its lasting influence.
Read more →